AbstractThis paper discusses a method for recognizing certain graph classes based on elimination schemes more efficiently. We reduce the time bound for recognizing quasi-triangulated graphs from O(n3) to O(n2.77), and perfect elimination bipartite and cop-win graphs from O(n3) to O(n3/logn)
AbstractPerfect elimination schemes (p.e.s.) occur in a number of important problems such as perfect...
SIGLETIB: RN 4052(89638-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
AbstractWe consider the problem of recognizing AT-free graphs. Although there is a simple O(n3) algo...
Many recognition problems for special classes of graphs and cycles can be reduced to finding and lis...
AbstractThis paper presents new algorithms for recognizing several classes of perfectly orderable gr...
A graph is quasi-triangulated if each of its induced subgraphs has a vertex which is either simplici...
Many recognition problems for special classes of graphs and cycles can be reduced to finding and lis...
AbstractWe present a polynomial-time algorithm for recognizing quasi-Meyniel graphs. A hole is a cho...
International audienceThis paper deals with the characterization and the recognition of graph classe...
AbstractWe present improved algorithms for the recognition and the weighted versions of the optimiza...
SIGLETIB: RN 4052(90637-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
AbstractA triangulated graph is a graph in which for every cycle of length ℓ > 3, there is an edge j...
AbstractA chordal graph H is a triangulation of a graph G if H is obtained by adding edges to G. If ...
Abstract. Hoàng and Reed defined the classes of Raspail (also known as Bipolarizable) and P4-simplic...
International audienceTolerance graphs model interval relations in such a way that intervals can tol...
AbstractPerfect elimination schemes (p.e.s.) occur in a number of important problems such as perfect...
SIGLETIB: RN 4052(89638-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
AbstractWe consider the problem of recognizing AT-free graphs. Although there is a simple O(n3) algo...
Many recognition problems for special classes of graphs and cycles can be reduced to finding and lis...
AbstractThis paper presents new algorithms for recognizing several classes of perfectly orderable gr...
A graph is quasi-triangulated if each of its induced subgraphs has a vertex which is either simplici...
Many recognition problems for special classes of graphs and cycles can be reduced to finding and lis...
AbstractWe present a polynomial-time algorithm for recognizing quasi-Meyniel graphs. A hole is a cho...
International audienceThis paper deals with the characterization and the recognition of graph classe...
AbstractWe present improved algorithms for the recognition and the weighted versions of the optimiza...
SIGLETIB: RN 4052(90637-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
AbstractA triangulated graph is a graph in which for every cycle of length ℓ > 3, there is an edge j...
AbstractA chordal graph H is a triangulation of a graph G if H is obtained by adding edges to G. If ...
Abstract. Hoàng and Reed defined the classes of Raspail (also known as Bipolarizable) and P4-simplic...
International audienceTolerance graphs model interval relations in such a way that intervals can tol...
AbstractPerfect elimination schemes (p.e.s.) occur in a number of important problems such as perfect...
SIGLETIB: RN 4052(89638-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
AbstractWe consider the problem of recognizing AT-free graphs. Although there is a simple O(n3) algo...
DOI
Add to ORKG