Graph operations that are good for greedoids (Q987691): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2010.04.009 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 0809.1806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3928230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new greedoid: The family of local maximum stable sets of a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Clique Corona Operation and Greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3587708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2010.04.009 / rank
 
Normal rank

Latest revision as of 11:25, 10 December 2024

scientific article
Language Label Description Also known as
English
Graph operations that are good for greedoids
scientific article

    Statements

    Identifiers