It is tough to be a plumber (Q1885007): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2002.12.002 / rank
Normal rank
 
Property / author
 
Property / author: Tomas Tichý / rank
Normal rank
 
Property / author
 
Property / author: Gerhard J. Woeginger / rank
Normal rank
 
Property / author
 
Property / author: Tomas Tichý / rank
 
Normal rank
Property / author
 
Property / author: Gerhard J. Woeginger / 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.tcs.2002.12.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2135480548 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57601589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special planar satisfiability problem and a consequence of its NP- completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the thickness of graphs is NP-hard / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2002.12.002 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:42, 16 December 2024

scientific article
Language Label Description Also known as
English
It is tough to be a plumber
scientific article

    Statements

    It is tough to be a plumber (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 October 2004
    0 references
    Combinatorial game theory
    0 references
    NP-completeness
    0 references

    Identifiers