Pages that link to "Item:Q3701460"
From MaRDI portal
The following pages link to Steiner trees, connected domination and strongly chordal graphs (Q3701460):
Displayed 50 items.
- The \(k\)-hop connected dominating set problem: hardness and polyhedra (Q324721) (← links)
- Chordality properties on graphs and minimal conceptual connections in semantic data models (Q579964) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On the terminal connection problem (Q831820) (← links)
- Cooperative mobile guards in grids (Q876501) (← links)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
- Minimum-maximal matching in series-parallel graphs (Q1099085) (← links)
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs (Q1099628) (← links)
- A unified approach to domination problems on interval graphs (Q1111566) (← links)
- On hypergraph acyclicity and graph chordality (Q1114449) (← links)
- Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Permutation graphs: Connected domination and Steiner trees (Q1174135) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Problems with generalized Steiner problems (Q1186806) (← links)
- Connected domination and Steiner set on weighted permutation graphs (Q1190520) (← links)
- Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (Q1328622) (← links)
- A parallel algorithm for computing Steiner trees in strongly chordal graphs (Q1329803) (← links)
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (Q1330902) (← links)
- The parallel solution of domination problems on chordal and strongly chordal graphs (Q1331893) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
- Making a dominating set of a graph connected (Q1656909) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
- Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy (Q2165280) (← links)
- The balanced connected subgraph problem for geometric intersection graphs (Q2166729) (← links)
- The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy (Q2181262) (← links)
- A multivariate analysis of the strict terminal connection problem (Q2306846) (← links)
- Steiner distance and convexity in graphs (Q2426451) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- Complexity of Steiner Tree in Split Graphs - Dichotomy Results (Q2795958) (← links)
- Connected Domination (Q3384607) (← links)
- Convexity in Graphs and Hypergraphs (Q3718757) (← links)
- Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs (Q4454318) (← links)
- THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS (Q4820130) (← links)
- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs (Q5048948) (← links)
- Connected domination and steiner set on asteroidal triple-free graphs (Q5060107) (← links)
- Counting dominating sets in generalized series-parallel graphs (Q5207508) (← links)
- 2-edge connected dominating sets and 2-connected dominating sets of a graph (Q5963646) (← links)
- On the computational difficulty of the terminal connection problem (Q6041044) (← links)
- Intersection graphs of non-crossing paths (Q6041577) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
- P versus NPC: minimum Steiner trees in convex split graphs (Q6102270) (← links)
- A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)