Prime Testing for the Split Decomposition of a Graph

descriptionPublicationkeyboard_double_arrow_right Article 01 Nov 1989 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Discrete Mathematics, volume 2, pages 590-599 (issn: 0895-4801, eissn: 1095-7146,

Copyright policy )

Authors: Jeremy P. Spinrad;

doi: 10.1137/0402051

Prime Testing for the Split Decomposition of a Graph

- Summary
- Subjects
- Metrics

Abstract

Summary: An \(O(n^ 2)\) algorithm for testing whether a graph is decomposable with respect to the split decomposition is developed. The fastest previous algorithm required \(\Omega (n^ 3)\) time for this problem. This leads to an \(O(n^ 2)\) expected time algorithm for computing the split decomposition of a graph.

Keywords

Graph theory, Analysis of algorithms and problem complexity, split decomposition, graph decomposition, join decomposition

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	7
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average