Pages that link to "Item:Q1111566"
From MaRDI portal
The following pages link to A unified approach to domination problems on interval graphs (Q1111566):
Displaying 50 items.
- Max point-tolerance graphs (Q344833) (← links)
- A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
- Algorithms for interval structures with applications (Q388095) (← links)
- The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
- Minimum 2-tuple dominating set of an interval graph (Q666518) (← links)
- 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)
- \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← 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)
- Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph (Q963461) (← 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)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
- Power domination in circular-arc graphs (Q1939660) (← links)
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- Dominating set of rectangles intersecting a straight line (Q2025079) (← links)
- An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph (Q2053252) (← links)
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q2111523) (← links)
- Algorithm and hardness results in double Roman domination of graphs (Q2118874) (← links)
- The \(k\)-power domination problem in weighted trees (Q2290632) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- On the independent dominating set polytope (Q2368719) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- On the thinness and proper thinness of a graph (Q2414456) (← links)
- Chronological rectangle digraphs which are two-terminal series-parallel (Q2414469) (← 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)
- Solving the maximum internal spanning tree problem on interval graphs in polynomial time (Q2636496) (← links)
- The stable set problem and the thinness of a graph (Q2643810) (← links)
- The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes (Q2840556) (← links)
- The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942) (← links)
- Parallel algorithms on interval graphs (Q4359285) (← links)
- A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs (Q4632175) (← 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)
