7 search results - page 2 / 2 » Equistable distance-hereditary graphs |
SWAT
1994
Springer
13 years 10 months ago
1994
Springer
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
SIAMDM
2008
13 years 4 months ago
2008
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for v...