Pages that link to "Item:Q3333069"
From MaRDI portal
The following pages link to Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs (Q3333069):
Displayed 19 items.
- Maximal independent sets in caterpillar graphs (Q765369) (← links)
- Counting and enumerating independent sets with applications to combinatorial optimization problems (Q784784) (← links)
- Maximum weight independent set of circular-arc graph and its application (Q861467) (← links)
- Counting the number of independent sets in chordal graphs (Q935840) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Generating all maximal independent sets on trees in lexicographic order (Q1328528) (← links)
- Coloring permutation graphs in parallel (Q1613373) (← links)
- Optimal separable partitioning in the plane (Q1893156) (← links)
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408) (← links)
- Path Problems in Complex Networks (Q2913787) (← links)
- Maximal independent sets in grid graphs (Q2968510) (← links)
- An efficient algorithm to generate all maximal independent sets on trapezoid graphs (Q4240618) (← links)
- Generate all maximal independent sets in permutation graphs (Q4323409) (← links)
- A parallel algorithm to generate all maximal independent sets on permutation graphs (Q4392327) (← links)
- A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time (Q4685763) (← links)
- The complexity of colouring circle graphs (Q5096797) (← links)
- Listing Maximal Independent Sets with Minimal Space and Bounded Delay (Q5150928) (← links)
- (Q5708515) (← links)