The following pages link to Elimination graphs (Q3189055):
Displayed 13 items.
- Generalized disk graphs (Q832849) (← links)
- Improved algorithms for resource allocation under varying capacity (Q1617284) (← links)
- A new decomposition technique for maximal clique enumeration for sparse graphs (Q1740688) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- Computing inductive vertex orderings (Q2234785) (← links)
- On tree-constrained matchings and generalizations (Q2258075) (← links)
- Set cover problems with small neighborhood covers (Q2322696) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Network design under general wireless interference (Q2665910) (← links)
- Spanning Trees With Edge Conflicts and Wireless Connectivity (Q5002848) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)
- The Power of Oblivious Wireless Power (Q5269826) (← links)
- Effective Wireless Scheduling via Hypergraph Sketches (Q5858652) (← links)