Titlebook: Combinatorial Algorithms; 27th International W Veli M?kinen,Simon J. Puglisi,Leena Salmela Conference proceedings 2016 Springer Internation

大包裹

gerrymander

Feedback

確認(rèn)

Anl?sse für Situationskl?rungentite graph . contains a non-crossing spanning tree whose maximum degree is at most .; this is the best possible upper bound on the maximum degree. This solves an open problem posed by Abellanas . at the Graph Drawing Symposium, 1996.

PAN

https://doi.org/10.1007/978-3-658-34328-6ansforms a given Steiner tree into another one by exchanging a single edge at a time. In this paper, we show that the problem is PSPACE-complete even for split graphs (and hence for chordal graphs), while solvable in linear time for interval graphs.

我正派

鐵砧

使成整體

https://doi.org/10.1007/978-3-319-44543-4approximation algorithms; data structures; dynamic programming; graph algorithms; social networks; algori

口味

978-3-319-44542-7Springer International Publishing Switzerland 2016

宇宙你

On the Complexity of Computing Treebreadthn are the maximum diameter and radius of its bags respectively. The . and the . of a graph are the minimum length and breadth of its tree-decompositions respectively. . and . are defined similarly for path-decompositions. In this paper, we answer open questions of [Dragan and K?hler, Algorithmica 20