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...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 412; no. 39; pp. 5187 - 5204
Main Authors:	Bui-Xuan, Binh-Minh, Telle, Jan Arne, Vatshelle, Martin
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier B.V 09.09.2011 Elsevier
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!