Pages that link to "Item:Q1111566"
From MaRDI portal
The following pages link to A unified approach to domination problems on interval graphs (Q1111566):
Displayed 27 items.
- Tree 3-spanners on interval, permutation and regular bipartite graphs (Q671393) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Recognizing graphs without asteroidal triples (Q876727) (← links)
- Linear algorithm for optimal path cover problem on interval graphs (Q911770) (← links)
- New sequential and parallel algorithms for interval graph recognition (Q922725) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- On finding the minimum bandwidth of interval graphs (Q1183610) (← links)
- Incorporating negative-weight vertices in certain vertex-search graph algorithms (Q1198080) (← links)
- Generalized vertex covering in interval graphs (Q1199467) (← links)
- Linear algorithm for domatic number problem on interval graphs (Q1262139) (← links)
- An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs (Q1273613) (← links)
- Computing the average distance of an interval graph (Q1334633) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
- On minimum intersection of two minimum dominating sets of interval graphs (Q1377653) (← links)
- Interval numbers of powers of block graphs (Q1420587) (← links)
- Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- On the independent dominating set polytope (Q2368719) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- The Roberts characterization of proper and unit interval graphs (Q2461218) (← links)
- Shiftable intervals (Q2480206) (← links)
- Fast algorithms for identifying maximal common connected sets of interval graphs (Q2499592) (← links)
- The stable set problem and the thinness of a graph (Q2643810) (← links)
- Parallel algorithms on interval graphs (Q4359285) (← links)
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs (Q4653706) (← links)
- THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS (Q4820130) (← links)
- Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph (Q4870967) (← links)