Código QR (código de barras bidimensional)

Hypertree-Width and Related Hypergraph Invariants

We study the notion of hypertree-width of hypergraphs. We prove that, up to a constant factor, hypertree-width is the same as a number of other hypergraph invariants that resemble graph invariants such as bramble-number, branch-width, linkedness, and the minimum number of cops required to win Seymou...

תיאור מלא

שמור ב:
Principais autores: Isolde Adler, Georg Gottlob, Martin Grohe
פורמט: Artigo
שפה:Inglês
יצא לאור: Discrete Mathematics & Theoretical Computer Science 2005-01-01
סדרה:Discrete Mathematics & Theoretical Computer Science
נושאים:
hypergraphs
tree decompositions
hypertree width
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[math.math-co] mathematics [math]/combinatorics [math.co]
גישה מקוונת:https://dmtcs.episciences.org/3424/pdf
תגים: הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!

פריטים דומים