Boolean-width of graphs

We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods–Boolean sums of neighborhoods–across a cut of a graph. For many graph problems, this number is the runtime bottleneck when using a divide-and-conquer approach. For an n -vertex graph given with...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 412; číslo 39; s. 5187 - 5204
Hlavní autoři:	Bui-Xuan, Binh-Minh, Telle, Jan Arne, Vatshelle, Martin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford Elsevier B.V 09.09.2011 Elsevier
Témata:	Algorithmics. Computability. Computer arithmetics Applied sciences Boolean algebra Combinatorics. Ordered structures Computer Science Computer science; control theory; systems Counting Data Structures and Algorithms Decomposition Exact sciences and technology FPT algorithm Graph decomposition Graphs Information retrieval. Graph Mathematics Minimum weight Miscellaneous Order, lattices, ordered algebraic structures Sciences and techniques of general use Sums Theoretical computing Trees Unions Width parameter Graph decomposition FPT algorithm Boolean algebra Width parameter Bottleneck Clique width Grid pattern Dominating set Computer theory Graph clique Vertex(graph) Rank Algorithm Minimum time Tree width Graph cut Independent set
ISSN:	0304-3975, 1879-2294
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!