Characteristics of the maximal independent set ZDD

David R. Morrison (), Edward C. Sewell and Sheldon H. Jacobson
Additional contact information
David R. Morrison: Univerisity of Illinois, Urbana-Champaign
Edward C. Sewell: Southern Illinois University, Edwardsville
Sheldon H. Jacobson: Univerisity of Illinois, Urbana-Champaign

Journal of Combinatorial Optimization, 2014, vol. 28, issue 1, No 8, 139 pages

Abstract: Abstract Zero-suppressed binary decision diagrams (ZDDs) are important data structures that are used in a number of combinatorial optimization settings. This paper explores a ZDD characterization for the maximal independent sets of a graph; a necessary and sufficient condition for when nodes in the ZDD can be merged is provided, and vertex orderings of the graph are studied to determine which orderings produce smaller ZDDs. A bound on the width of the maximal independent set ZDD is obtained, relating it to the Fibonacci numbers. Finally, computational results are reported.

Keywords: Independent sets; Graph theory; Binary decision diagrams (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9722-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:28:y:2014:i:1:d:10.1007_s10878-014-9722-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9722-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().