220 search results - page 2 / 44 » Reconstruction Algorithm for Permutation Graphs |
WG
2004
Springer
14 years 26 days ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
DAGSTUHL
2006
13 years 9 months ago
2006
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...
WG
2010
Springer
13 years 5 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
COCOA
2010
Springer
13 years 5 months ago
2010
Springer
WG
2009
Springer
14 years 2 months ago
2009
Springer
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This class of graphs, which generalizes...