scientific article; zbMATH DE number 2230256
From MaRDI portal
Publication:5708549
zbMath1075.05548MaRDI QIDQ5708549
Publication date: 18 November 2005
Full work available at URL: http://www.sciencedirect.com/science/journal/15710653
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- On generating all maximal independent sets
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Unnamed Item
- Unnamed Item
This page was built for publication: