Computing hypergraph width measures exactly (Q437685): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C65 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C90 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6058202 / rank
 
Normal rank
Property / zbMATH Keywords
 
design of algorithms
Property / zbMATH Keywords: design of algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
graph algorithms
Property / zbMATH Keywords: graph algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
generalized hypertree-width
Property / zbMATH Keywords: generalized hypertree-width / rank
 
Normal rank
Property / zbMATH Keywords
 
fractional hypertree-width
Property / zbMATH Keywords: fractional hypertree-width / rank
 
Normal rank
Property / zbMATH Keywords
 
exact exponential algorithms
Property / zbMATH Keywords: exact exponential algorithms / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979091081 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1106.4719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Minimum Fill-in: Grouping the Minimal Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Treewidth and Minimum Fill-In / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth Computation and Extremal Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Induced Subgraphs via Minimal Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypertree decompositions and tractable queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint solving via fractional edge covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: When is the evaluation of conjunctive queries tractable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On treewidth and minimum fill-in of asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable hypergraph properties for constraint satisfaction and conjunctive queries / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:22, 5 July 2024

scientific article
Language Label Description Also known as
English
Computing hypergraph width measures exactly
scientific article

    Statements

    Computing hypergraph width measures exactly (English)
    0 references
    0 references
    0 references
    0 references
    18 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    design of algorithms
    0 references
    graph algorithms
    0 references
    generalized hypertree-width
    0 references
    fractional hypertree-width
    0 references
    exact exponential algorithms
    0 references
    0 references
    0 references