Titlebook: ;

excrete

多嘴多舌

https://doi.org/10.1007/978-94-010-3177-6 of the Decomposable Graph Recognition problem, and proved the problem to be .-complete for graphs with maximum degree 4, and gave a polynomial algorithm for graphs with maximum degree 3. In this paper it is shown that the problem is .-complete when restricted to planar graphs with girth 5 and plana

Mirage

https://doi.org/10.1007/978-3-662-43550-2n .. The tree .-spanner problem asks whether a graph admits a tree .-spanner, given .. We first substantially strengthen the known results for bipartite graphs. We prove that the tree .-spanner problem is .-complete even for chordal bipartite graphs for .?≥?5, and every bipartite ATE–free graph has

AGONY

https://doi.org/10.1007/978-1-4615-4297-1thms, the new algorithm uses a multisweep Lexicographic Breadth First Search (LexBFS) approach, and introduces a new variant of LexBFS, called LexBFS., operating on the complement of the given graph . and breaking ties with respect to an initial LexBFS. The algorithm either produces the cotree of .

PTCA635

通情達(dá)理

Majid Sarrafzadeh,Maogang Wang,Xiaojian Yangal approximation algorithm, the shortest-path-first greedy algorithm (SGA), for MEDP in complete graphs. Previously, it was known that this ratio is at most 54. Adapting results by Kolman and Scheideler [Proceedings of SODA, 2002, pp. 184–193], we show that SGA achieves approximation ratio 8.+1 for

Derogate

認(rèn)識(shí)

休息

游行

https://doi.org/10.1007/978-3-030-63930-3.-tree has a tree-partition such that each bag induces a (.-1)-tree, amongst other properties. Applications of this result to two well-studied models of graph layout are presented. First it is proved that graphs of bounded tree-width have bounded ., thus resolving an open problem due to Ganley and H