A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
2006
Journal of Graph Algorithms and Applications
Three classes of graphs, simplicial, upper bound, and middle graphs, have been known for some time, but many of their algorithmic properties have not been published. The definitions for these graph classes are reviewed, and their relationships with other common graph classes (especially line and perfect graphs) are presented. Efficient algorithms are referenced or outlined to recognize each class of graphs. Finally, for each class of graphs and most of the common parameters of graphs, either an
doi:10.7155/jgaa.00123
fatcat:s7gzuht6onbvjb4emomuxmztx4