Skip to search formSkip to main contentSkip to account menu

Split (graph theory)

Known as: Split decomposition 
In graph theory, a split of an undirected graph is a cut whose cut-set forms a complete bipartite graph. A graph is prime if it has no splits. The… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We present a quasi linear-time algorithm for Maximum Matching on distance-hereditary graphs and some of their generalizations… 
2018
2018
Designing effective exact algorithms for graph coloring problem is still an interesting topic. Instead of getting only one best… 
2012
2012
Physalia is a genus of pelagic colonial hydrozoans often known by common names such as ‘Portuguese-man-of-war’ or ‘bluebottle… 
2006
2006
Let K denote a field and let V denote a vector space over K with finite positive dimension. We consider a pair of linear… 
2005
2005
  • B. Courcelle
  • 2005
  • Corpus ID: 43872399
1990
1990
The split decomposition of a graph, which is also known as the join decomposition [GHS], ms], was developed by Cunningham [Cu…