286 search results - page 3 / 58 » Recognition Algorithm for Diamond-Free Graphs |
102
click to vote
ESA
2009
Springer
15 years 4 months ago
2009
Springer
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
EJC
2011
14 years 6 months ago
2011
We present an algorithm which takes a graph as input and decides in cubic time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algor...
WG
2007
Springer
15 years 5 months ago
2007
Springer
NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the ...
DAM
1999
14 years 11 months ago
1999
Parity graphs form a superclass of bipartite and distance-hereditary graphs. Since their introduction, all the algorithms proposed as solutions to the recognition problem and othe...
WG
2010
Springer
14 years 9 months ago
2010
Springer
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...