\(O(m\log n)\) split decomposition of strongly-connected graphs (Q972339): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Benson L. Joeris / rank
Normal rank
 
Property / author
 
Property / author: Benson L. Joeris / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2009.10.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3023454559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph Decompositions and Eulerian Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing prime graphs and recognizing circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extension of bipartite to parity graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositions for perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing circle graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PC trees and circular-ones arrangements. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n2) Algorithm for Undirected Split Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime Testing for the Split Decomposition of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Comparability and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670598 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:16, 2 July 2024

scientific article
Language Label Description Also known as
English
\(O(m\log n)\) split decomposition of strongly-connected graphs
scientific article

    Statements

    \(O(m\log n)\) split decomposition of strongly-connected graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 May 2010
    0 references
    0 references
    split decomposition
    0 references
    graph decomposition
    0 references
    join decomposition
    0 references
    0 references