The Hamiltonian problem on distance-hereditary graphs (Q2489947): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2005.07.012 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2005.07.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2157955289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple parallel tree contraction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel recognition algorithms of cographs and distance hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-Hereditary Graphs, Steiner Trees, and Connected Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-based parallel algorithm design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-optimal solution for the path cover problem on cographs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for Hamiltonian problems on quasi-threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel recognition of cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted connected domination and Steiner trees in distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The path-partition problem in bipartite distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2005.07.012 / rank
 
Normal rank

Latest revision as of 23:47, 18 December 2024

scientific article
Language Label Description Also known as
English
The Hamiltonian problem on distance-hereditary graphs
scientific article

    Statements

    The Hamiltonian problem on distance-hereditary graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    Distance-hereditary graphs
    0 references
    Hamiltonian problem
    0 references
    Parallel algorithms
    0 references
    PRAM
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references