Sparse graph certificates for mixed connectivity (Q1781979): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for <i>k</i>-Vertex Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mixed connectivity certificates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse subgraphs preserving connectivity properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on n-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimally n-line connected graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existenz gewisser Konfigurationen in \(n\)-gesättigten Graphen und in Graphen genügend großer Kantendichte / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-connectivity and decomposition of graphs into forests / rank
 
Normal rank

Latest revision as of 12:18, 10 June 2024

scientific article
Language Label Description Also known as
English
Sparse graph certificates for mixed connectivity
scientific article

    Statements