Pages that link to "Item:Q3990622"
From MaRDI portal
The following pages link to Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph (Q3990622):
Displaying 15 items.
- Approximately counting locally-optimal structures (Q295655) (← links)
- Generating bicliques of a graph in lexicographic order (Q557825) (← links)
- A new fast heuristic for labeling points (Q987799) (← links)
- Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
- The maximum clique problem (Q1318271) (← links)
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408) (← links)
- On the \(k\)-colored rainbow sets in fixed dimensions (Q2150582) (← links)
- Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy (Q2165280) (← links)
- An optimal algorithm to generate tilings (Q2466003) (← links)
- Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs (Q3333069) (← links)
- Approximately Counting Locally-Optimal Structures (Q3448823) (← links)
- An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph (Q3790662) (← links)
- (Q5111885) (← links)
- (Q5115821) (← links)
- Stackelberg strategies on epidemic containment games (Q6535824) (← links)
