Titlebook: ;

corporate

On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Grants of planar upward drawings of several families of directed trees, we show how the results obtained for trees can be exploited to determine asymptotic optimal values for the area occupation of planar upward drawings of . and ..

figment

臭了生氣

不能仁慈

訓(xùn)誡

https://doi.org/10.1007/978-3-662-65584-9?. is connected. We also show that the problem of deciding the connectedness of the 3-colour graph of a bipartite graph is coNP-complete, but that restricted to planar bipartite graphs, the question is answerable in polynomial time.

拾落穗

Tree-Width and Optimization in Bounded Degree Graphs,ph problems – dominating set, independent dominating set and induced matching – and obtain several results toward revealing the equivalency between boundedness of the tree-width and polynomial-time solvability of these problems in bounded degree graphs.

aqueduct

高歌

On Finding Graph Clusterings with Maximum Modularity,hardness of maximizing modularity both in the general case and with the restriction to cuts, and give an Integer Linear Programming formulation. This is complemented by first insights into the behavior and performance of the commonly applied greedy agglomaration approach.

Dealing

Mixing 3-Colourings in Bipartite Graphs,?. is connected. We also show that the problem of deciding the connectedness of the 3-colour graph of a bipartite graph is coNP-complete, but that restricted to planar bipartite graphs, the question is answerable in polynomial time.

GAVEL