Recognition of Unipolar and Generalised Split Graphs
AbstractA graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar. A unipolar partition of a graph can be used to find efficiently the clique number, the stability number, the chromatic number, and to solve other problems that are hard for general graphs. We present an O(n2)-time algorithm for recognition of n-vertex generalised split graphs, improving on previous O(n3)-time algorithms. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
McDiarmid, C.; Yolov, N. Recognition of Unipolar and Generalised Split Graphs. Algorithms 2015, 8, 46-59.
McDiarmid C, Yolov N. Recognition of Unipolar and Generalised Split Graphs. Algorithms. 2015; 8(1):46-59.Chicago/Turabian Style
McDiarmid, Colin; Yolov, Nikola. 2015. "Recognition of Unipolar and Generalised Split Graphs." Algorithms 8, no. 1: 46-59.