244 search results - page 26 / 49 » Intervalizing k-Colored Graphs |
98
Voted
JGT
2007
15 years 2 months ago
2007
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved...
125
click to vote
SWAT
1994
Springer
15 years 6 months ago
1994
Springer
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
102
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
125
Voted
IJFCS
2007
15 years 2 months ago
2007
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
128
click to vote
GD
2005
Springer
15 years 8 months ago
2005
Springer
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one co...