Minor-matching hypertree width

MaRDI QIDQ4607892zbMATH OpenFDO

Authors Nikola Yolov

Publication date 15 March 2018

Full work available at URL https://arxiv.org/abs/1704.02939, http://dl.acm.org/citation.cfm?id=3175282

zbMATH Keywords

tree decompositionwidth measure

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Hypergraphs (05C65)

Recommendations

• Graph-Theoretic Concepts in Computer Science
• Approximating fractional hypertree width
• Approximating fractional hypertree width
• scientific article; zbMATH DE number 1834638
• A backtracking-based algorithm for hypertree decomposition

Cited in

(16)

• Fair allocation algorithms for indivisible items under structured conflict constraints
• Treewidth versus clique number. II: Tree-independence number
• New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth
• Computing tree decompositions with small independence number
• The simultaneous interval number: a new width parameter that measures the similarity to interval graphs
• Max weight independent set in sparse graphs with no long claws
• On treewidth and maximum cliques
• Unavoidable induced subgraphs in graphs with complete bipartite induced minors
• A survey of degree-boundedness
• Excluding a clique or a biclique in graphs of bounded induced matching treewidth
• Comparing width parameters on graph classes
• Tree decompositions meet induced matchings: beyond max weight independent set
• Treewidth versus clique number. V: Further connections with tree-independence number
• Excluding an induced wheel minor in graphs without large induced stars
• Polynomial-time recognition and maximum independent set in Burling graphs
• Tree decompositions meet induced matchings: beyond max weight independent set

This page was built for publication: Minor-matching hypertree width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607892)