Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Linear algorithm for optimal path cover problem on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness results for some problems on subclasses of bipartite and chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Matchings in Convex Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The induced matching and chain subgraph cover problems for convex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deferred-query: An efficient approach for some problems on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for paired-domination problem in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling algorithms for paired-domination problems in block and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired domination on interval and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for the paired-domination problem on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in convex and chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 0(n log n) algorithm for the convex bipartite matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching in a convex bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in Node-Weighted Convex Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: HAMILTONian circuits in chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Maximum Edge Bicliques in Convex Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5506330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum independent set in convex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge domination on bipartite permutation graphs and cotriangulated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for maximum matchings in convex, bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bottleneck independent domination on the classes of bipartite graphs and block graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the k-chain subgraph cover problem / rank
 
Normal rank

Latest revision as of 23:49, 5 July 2024

scientific article
Language Label Description Also known as
English
Linear-time algorithm for the paired-domination problem in convex bipartite graphs
scientific article

    Statements

    Linear-time algorithm for the paired-domination problem in convex bipartite graphs (English)
    0 references
    0 references
    6 December 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    linear-time algorithms
    0 references
    paired-domination
    0 references
    total domination
    0 references
    convex bipartite graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references