Domination, independent domination, and duality in strongly chordal graphs
From MaRDI portal
(Redirected from Publication:788002)
Recommendations
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
- scientific article; zbMATH DE number 4045183
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- Steiner trees, connected domination and strongly chordal graphs
- A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
Cites work
- scientific article; zbMATH DE number 3648727 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3784915 (Why is no real title available?)
- scientific article; zbMATH DE number 3557519 (Why is no real title available?)
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3371820 (Why is no real title available?)
- R -Domination in Graphs
- A linear algorithm for the domination number of a tree
- Algorithmic Aspects of Vertex Elimination on Graphs
- Balanced matrices
- Characterizations of strongly chordal graphs
- Characterizations of totally balanced matrices
- Dominating Sets in Chordal Graphs
- Independent domination in chordal graphs
- Optimum domination in weighted trees
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Totally-Balanced and Greedy Matrices
- Towards a theory of domination in graphs
- Triangulated graphs and the elimination process
Cited in
(only showing first 100 items - show all)- Strong Chordality of Graphs with Possible Loops
- Dominating cliques in chordal graphs
- The bottleneck independent domination on the classes of bipartite graphs and block graphs.
- Algorithmic aspects of clique-transversal and clique-independent sets
- Semi-dynamic algorithms for strongly chordal graphs
- On defensive alliances and strong global offensive alliances
- A linear algorithm for the group path problem on chordal graphs
- A polyhedral view to a generalization of multiple domination
- Broadcast domination and multipacking in strongly chordal graphs
- Permutation graphs: Connected domination and Steiner trees
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs
- Weighted maximum-clique transversal sets of graphs
- An improved exact algorithm for the domatic number problem
- The domatic number of block-cactus graphs
- Labeling algorithms for domination problems in sun-free chordal graphs
- Efficient \((j, k)\)-dominating functions
- Independent domination in chordal graphs
- Location problems
- The domatic number problem on some perfect graph families
- Extension and its price for the connected vertex cover problem
- Deferred-query—An efficient approach for problems on interval and circular-arc graphs
- CONVEXITY OF MINIMAL DOMINATING FUNCTIONS OF TREES: A SURVEY
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- It is all labeling
- Total domination in block graphs
- Roman domination on strongly chordal graphs
- Paired-domination problem on distance-hereditary graphs
- Dually and strongly chordal graphs
- Generalized domination and efficient domination in graphs
- On the \(k\)-limited packing numbers in graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- On total \(f\)-domination: polyhedral and algorithmic results
- The topology of the independence complex
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
- The weakly connected independent set polytope in corona and join of graphs
- A characterization of strongly chordal graphs
- An approximation algorithm for clustering graphs with dominating diametral path
- On complexities of minus domination
- Strong elimination ordering of the total graph of a tree
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- The minimum weakly connected independent set problem: polyhedral results and branch-and-cut
- On the computational complexity of upper fractional domination
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms
- Independent Domination in Triangle Graphs
- Polar SAT and related graphs
- Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
- scientific article; zbMATH DE number 2024687 (Why is no real title available?)
- Characterizations of strongly chordal graphs
- Deferred-query: An efficient approach for some problems on interval graphs
- The algorithmic complexity of mixed domination in graphs
- Fractional domination of strong direct products
- Complexity of distance paired-domination problem in graphs
- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
- Fractional dominating parameters
- On \(f\)-domination: polyhedral and algorithmic results
- Domination in convex and chordal bipartite graphs
- scientific article; zbMATH DE number 7666852 (Why is no real title available?)
- Algorithms for generating strongly chordal graphs
- Broadcast domination in graphs
- The domatic number problem
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- Construction of a simple elimination scheme for a chordal comparability graph in linear time
- Dominating sets in perfect graphs
- On the independent dominating set polytope
- On the parameterized complexity of multiple-interval graph problems
- \(k\)-tuple domination in graphs
- A linear algorithm for finding a minimum dominating set in a cactus
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
- On dominating set polyhedra of circular interval graphs
- Recognizing clique graphs of directed and rooted path graphs
- Dominating sets and domatic number of circular arc graphs
- On bondage numbers of graphs: a survey with some comments
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Weighted upper edge cover: complexity and approximability
- Graphs with unique dominating sets
- Totally balanced and totally unimodular matrices defined by center location problems
- Equitable domination in graphs
- Real and integer domination in graphs
- Broadcast domination and multipacking: bounds and the integrality gap
- Strongly simplicial vertices of powers of trees
- Linear programming approach for various domination parameters
- Independent domination in directed graphs
- Characterizations of two classes of digraphs
- On complexities of minus domination
- A parallel algorithm for computing Steiner trees in strongly chordal graphs
- Strong Cocomparability Graphs and Slash-Free Orderings of Matrices
- Fractional domination game
- Semipaired Domination in Some Subclasses of Chordal Graphs
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs
- Domination and total domination on asteroidal triple-free graphs
- Independent domination in hereditary classes
- Packing and domination parameters in digraphs
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Which claw-free graphs are perfectly orderable?
- The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs
- Common extremal graphs for three inequalities involving domination parameters
- A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
- Shiftable intervals
This page was built for publication: Domination, independent domination, and duality in strongly chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q788002)
