The following pages link to Dominations in trapezoid graphs (Q1342259):
Displaying 14 items.
- A linear time algorithm for finding depth-first spanning trees on trapezoid graphs (Q287118) (← links)
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Efficient algorithm for the vertex connectivity of trapezoid graphs (Q396607) (← links)
- Trapezoid graphs and generalizations, geometry and algorithms (Q678864) (← links)
- Efficient algorithms for the minimum connected domination on trapezoid graphs (Q881872) (← links)
- Trapezoid graphs and their coloring (Q1111577) (← links)
- Parallel algorithms for the domination problems in trapezoid graphs (Q1356505) (← links)
- On the structure of trapezoid graphs (Q1917308) (← links)
- Connected domination and dominating clique in trapezoid graphs (Q1962037) (← links)
- Computation of inverse 1-center location problem on the weighted trapezoid graphs (Q2212218) (← links)
- Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs (Q3568416) (← links)
- An efficient algorithm to generate all maximal independent sets on trapezoid graphs (Q4240618) (← links)
- An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (Q5069774) (← links)
