Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59567665, #quickstatements; #temporary_batch_1712201099914
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph separators: A parameterized view / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity: exponential speed-up for planar graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tour Merging via Branch-Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the Hamiltonian cycle problem in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential parameterized algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph Isomorphism in Planar Graphs and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on the decomposability of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The searching over separators strategy to solve some NP-hard problems in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Study on Dominating Set Problem of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank

Latest revision as of 07:01, 3 July 2024

scientific article
Language Label Description Also known as
English
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
scientific article

    Statements

    Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 September 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    Exact and parameterized algorithms
    0 references
    Planar graphs
    0 references
    Treewidth
    0 references
    Branchwidth
    0 references
    Traveling salesman problem
    0 references
    Hamiltonian cycle
    0 references
    0 references
    0 references