— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
Abstract. We study the two-layer planarization problems that have applications in Automatic Graph Drawing. We are searching for a two-layer planar subgraph of maximumweight in a gi...
: With the increase of the number of wavelengths per fiber waveband switching has been proposed to decrease the number of switching ports in optical nodes. Another concept that of ...