油毡
发表于 2025-3-30 10:45:37
https://doi.org/10.1007/978-3-030-92735-6d studied in a number of articles. Our contribution is twofold. We provide approximation algorithms for computing a uniquely restricted matching of maximum size in some bipartite graphs. In particular, we achieve a ratio of 5/9 for subcubic bipartite graphs, improving over a 1/2-approximation algori
喧闹
发表于 2025-3-30 15:34:41
Ton J. Cleophas,Aeilko H. Zwindermane show that this natural generalization of . is much harder on several basic graph classes. In particular, we show that it is NP-hard on split graphs, even when one of the two parameters . is set to the smallest possible fixed value that does not trivialize the problem (. or .). Together with a simp
粗糙
发表于 2025-3-30 17:04:46
Robert Hawkes,Ingrid Mann,Peter Brown graph as long as the set of tokens still defines an independent set of .. Given two independent sets . and ., the . problem consists in deciding whether there exists a sequence of independent sets which transforms . into . so that every pair of consecutive independent sets of the sequence can be ob
Magnificent
发表于 2025-3-30 20:51:09
https://doi.org/10.1007/978-94-007-3024-3 graphs where the path on the grid associated to each vertex has at most . bends. Epstein et al. showed in 2013 that computing a maximum clique in .-EPG graphs is polynomial. As remarked in , when the number of bends is at least 4, the class contains 2-interval graphs for which co
entrance
发表于 2025-3-31 02:58:47
https://doi.org/10.1007/978-1-4471-0399-8In particular, we show that:.The first result answers an open problem posed by Cabello and Jejčič. The third result confirms a conjecture by Cabello. We thereby completely elucidate the remaining open questions on the containment relations between these classes of segment graphs. We further characte
阻塞
发表于 2025-3-31 05:26:57
http://reply.papertrans.cn/39/3881/388012/388012_56.png
LITHE
发表于 2025-3-31 11:33:47
http://reply.papertrans.cn/39/3881/388012/388012_57.png
absolve
发表于 2025-3-31 16:44:15
Kent K. Stewart,John R. Whitakervertices, for fixed .. We propose an algorithm that, given a 3-colorable graph without an induced path on . vertices, computes a coloring with . many colors. If the input graph is triangle-free, we only need . many colors. The running time of our algorithm is . if the input graph has . vertices and
BOLT
发表于 2025-3-31 17:34:13
https://doi.org/10.1007/978-1-4684-1830-9ne to another. An instance of the problem consists of a capacitated directed network, in which vertices express their preferences over their incident edges. A network flow is stable if there is no group of vertices that all could benefit from rerouting the flow along a walk..Fleiner [.] established
Congeal
发表于 2025-4-1 00:56:04
http://reply.papertrans.cn/39/3881/388012/388012_60.png