Complexities of some interesting problems on spanning trees (Q1041729): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.ipl.2004.12.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059123237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing systems in spite of distributed control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing full spanning trees for cubic graphs / rank
 
Normal rank

Latest revision as of 05:38, 2 July 2024

scientific article
Language Label Description Also known as
English
Complexities of some interesting problems on spanning trees
scientific article

    Statements

    Complexities of some interesting problems on spanning trees (English)
    0 references
    0 references
    0 references
    4 December 2009
    0 references
    computational complexity
    0 references
    decision problem
    0 references
    graphs
    0 references
    NP-completeness
    0 references
    spanning trees
    0 references
    combinatorial problems
    0 references

    Identifiers