严厉谴责
发表于 2025-3-25 06:38:55
http://reply.papertrans.cn/39/3881/388020/388020_21.png
detach
发表于 2025-3-25 09:04:18
Optimal General Matchings,. such that . for each vertex ., where . denotes the number of edges of . incident to .. The general matching problem asks the existence of a .-matching in a given graph. A set .(.) is said to have a . . if there exists a number . such that . and .. Without any restrictions the general matching prob
茁壮成长
发表于 2025-3-25 15:34:04
http://reply.papertrans.cn/39/3881/388020/388020_23.png
Pericarditis
发表于 2025-3-25 15:55:25
http://reply.papertrans.cn/39/3881/388020/388020_24.png
门闩
发表于 2025-3-25 22:55:50
http://reply.papertrans.cn/39/3881/388020/388020_25.png
乳汁
发表于 2025-3-26 00:30:52
Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization, the ., one wishes to find a path cover of minimum cardinality. In this problem, known to be .-hard, the set . may contain trivial (single-vertex) paths. We study the problem of finding a path cover composed only of nontrivial paths. First, we show that the corresponding existence problem can be red
Canvas
发表于 2025-3-26 06:58:42
https://doi.org/10.1007/978-3-662-66655-5such that: (i) no two edges of the same page cross, and (ii) no two edges of the same page share a common endvertex. The minimum number of pages needed in a dispersable book embedding of . is called its ., .(.). Graph . is called . if . equals the maximum degree of ., . (note that . always holds)..B
执
发表于 2025-3-26 12:28:48
Moderne Baukonstruktion: Fassadensult from Corneil and Stacho, these graphs were characterised through a linear vertex ordering called an AT-free order. Here, we use techniques from abstract convex geometry to improve on this result by giving a vertex order characterisation with stronger structural properties and thus resolve an op
起波澜
发表于 2025-3-26 14:01:19
http://reply.papertrans.cn/39/3881/388020/388020_29.png
Dignant
发表于 2025-3-26 16:59:39
https://doi.org/10.1007/978-3-662-28402-5cutively in a walk in the graph. In this paper, we look for the smallest set of transitions needed to be able to go from any vertex of the given graph to any other. We prove that this problem is NP-hard and study approximation algorithms. We develop theoretical tools that help to study this problem.