Physical Sciences and Mathematics Commons^™

Linear Time Optimization Algorithms For P4-Sparse Graphs, Beverly Jamison, Stephan Olariu

Computer Science Faculty Publications

Quite often, real-life applications suggest the study of graphs that feature some local density properties. In particular, graphs that are unlikely to have more than a few chordless paths of length three appear in a number of contexts. A graph G is P₄-sparse if no set of five vertices in G induces more than one chordless path of length three. P₄-sparse graphs generalize both the class of cographs and the class of P₄-reducible graphs. It has been shown that P₄-sparse graphs can be recognized in time linear in the size of the …