On matroids and hierarchical graphs (Q1178207): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding a minimum spanning pseudoforest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3759947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite subgraphs as matroid circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of combinatorial problems with succinct input representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank

Revision as of 12:22, 15 May 2024

scientific article
Language Label Description Also known as
English
On matroids and hierarchical graphs
scientific article

    Statements