Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph.
Min-Sheng LinYung-Jui ChenPublished in: Inf. Process. Lett. (2008)
Keyphrases
- maximum number
- constant factor
- computational complexity
- memory requirements
- space complexity
- worst case
- learning algorithm
- edge weights
- running times
- maximal cliques
- directed graph
- small number
- random graphs
- grow exponentially
- structured data
- bounded degree
- graph theoretic
- undirected graph
- spanning tree
- graph theory
- space requirements
- suffix array
- graph search
- graph matching
- planar graphs
- hamiltonian cycle
- fixed parameter tractable
- lower bound
- polynomial time complexity
- data structure