Pages that link to "Item:Q4210127"
From MaRDI portal
The following pages link to Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs (Q4210127):
Displaying 50 items.
- Efficient and perfect domination on circular-arc graphs (Q324824) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- Efficient algorithms for the conditional covering problem (Q690494) (← links)
- Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- Algorithms for finding clique-transversals of graphs (Q940841) (← links)
- Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph (Q963461) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Independent domination in finitely defined classes of graphs (Q1399990) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- The complexity of dominating set in geometric intersection graphs (Q1737591) (← links)
- The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (Q1751176) (← links)
- A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs (Q1950396) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- Connected domination and dominating clique in trapezoid graphs (Q1962037) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Dominating sets reconfiguration under token sliding (Q2032965) (← links)
- Total 2-domination of proper interval graphs (Q2043384) (← links)
- Tuple domination on graphs with the consecutive-zeros property (Q2132374) (← links)
- Small \(k\)-pyramids and the complexity of determining \(k\) (Q2253900) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407) (← links)
- Paired domination on interval and circular-arc graphs (Q2384392) (← links)
- A linear time algorithm for liar's domination problem in proper interval graphs (Q2445259) (← links)
- On dominating set polyhedra of circular interval graphs (Q2659194) (← links)
- On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem (Q2773025) (← links)
- Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals (Q2980919) (← links)
- The degree-preserving spanning tree problem in strongly chordal and directed path graphs (Q3057180) (← links)
- Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
- On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators (Q3181057) (← links)
- Connected Domination (Q3384607) (← links)
- Independent Domination in Triangle Graphs (Q3439603) (← links)
- Domination cover number of graphs (Q4634292) (← links)
- The Dominating Set Problem in Geometric Intersection Graphs (Q5111873) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
- On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm (Q5247696) (← links)
- Domination problems on P<sub>5</sub>-free graphs (Q5248877) (← links)
- Domination in Geometric Intersection Graphs (Q5458576) (← links)
- On \(H\)-topological intersection graphs (Q5925535) (← links)
- An efficient algorithm for distance total domination in block graphs (Q5963627) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
- Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)
- On approximation of multiple intruder locating domination number of a graph (Q6551048) (← links)
