Steiner trees, connected domination and strongly chordal graphs
From MaRDI portal
(Redirected from Publication:3701460)
Recommendations
- Doubly chordal graphs, steiner trees, and connected domination
- Permutation graphs: Connected domination and Steiner trees
- A parallel algorithm for computing Steiner trees in strongly chordal graphs
- Connected domination and Steiner set on weighted permutation graphs
- Steiner intervals in strongly chordal graphs
Cites work
Cited in
(73)- Minimum-maximal matching in series-parallel graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- A unified approach to domination problems on interval graphs
- On hypergraph acyclicity and graph chordality
- Labeling algorithms for domination problems in sun-free chordal graphs
- Dominating sets in perfect graphs
- Permutation graphs: Connected domination and Steiner trees
- Representations of graphs and networks (coding, layouts and embeddings)
- Problems with generalized Steiner problems
- Connected domination and Steiner set on weighted permutation graphs
- Strong elimination ordering of the total graph of a tree
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
- A parallel algorithm for computing Steiner trees in strongly chordal graphs
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- The parallel solution of domination problems on chordal and strongly chordal graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Making a dominating set of a graph connected
- The k-hop connected dominating set problem: approximation and hardness
- Steenrod problem and the domination relation
- Complexity of distance paired-domination problem in graphs
- On Steiner trees and minimum spanning trees in hypergraphs
- On bondage numbers of graphs: a survey with some comments
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- Paired-domination problem on distance-hereditary graphs
- Revising Johnson's table for the 21st century
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage
- Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy
- The balanced connected subgraph problem for geometric intersection graphs
- The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy
- A multivariate analysis of the strict terminal connection problem
- Steiner distance and convexity in graphs
- Steiner trees for hereditary graph classes: a treewidth perspective
- Complexity of Steiner tree in split graphs -- dichotomy results
- The k-hop connected dominating set problem: hardness and polyhedra
- Connected domination
- Steiner intervals in strongly chordal graphs
- Convexity in Graphs and Hypergraphs
- scientific article; zbMATH DE number 3963856 (Why is no real title available?)
- scientific article; zbMATH DE number 1262809 (Why is no real title available?)
- Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs
- Total domination, connected vertex cover and Steiner tree with conflicts
- THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS
- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
- Connected domination and steiner set on asteroidal triple-free graphs
- Counting dominating sets in generalized series-parallel graphs
- Doubly chordal graphs, steiner trees, and connected domination
- Chordality properties on graphs and minimal conceptual connections in semantic data models
- 2-edge connected dominating sets and 2-connected dominating sets of a graph
- On the computational difficulty of the terminal connection problem
- Intersection graphs of non-crossing paths
- Parameterized complexity of multicut in weighted trees
- P versus NPC: minimum Steiner trees in convex split graphs
- A linear-time algorithm for semitotal domination in strongly chordal graphs
- Homogeneously orderable graphs and the Steiner tree problem
- On convexity in split graphs: complexity of Steiner tree and domination
- Short cycles dictate dichotomy status of the Steiner tree problem on bisplit graphs
- Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs
- Balanced substructures in bicolored graphs
- Sequentially swapping tokens: further on graph classes
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage
- Open packing in H-free graphs and subclasses of split graphs
- Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
- Balanced substructures in bicolored graphs
- Sequentially swapping tokens: further on graph classes
- Domination and cut problems on chordal graphs with bounded leafage
- Bisplit graphs -- a structural and algorithmic study
- Domination, independent domination, and duality in strongly chordal graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- On the terminal connection problem
- Cooperative mobile guards in grids
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
This page was built for publication: Steiner trees, connected domination and strongly chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3701460)
