Treewidth computations. I: Upper bounds (Q964001): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q59567681, #quickstatements; #temporary_batch_1715314706700
 
(8 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Boost / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ComputeTW / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BGL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Treewidthlib / 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.ic.2009.03.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2116793595 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59567681 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:20, 10 May 2024

scientific article
Language Label Description Also known as
English
Treewidth computations. I: Upper bounds
scientific article

    Statements

    Treewidth computations. I: Upper bounds (English)
    0 references
    0 references
    0 references
    14 April 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    treewidth
    0 references
    upper bounds
    0 references
    heuristics
    0 references
    approximation algorithms
    0 references
    graph algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references