Reconstructing Cactus Graphs from Shortest Path Information (Q2830066): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Evangelos Kranakis / rank
 
Normal rank
Property / author
 
Property / author: Danny Krizanc / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-41168-2_13 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2491586093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph reconstruction with a betweenness oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing a Graph from its Neighborhood Lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centdian Computation in Cactus Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost every graph has reconstruction number three / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of the degree sequences of 2-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of reconstructing H-free graphs from their Star Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of Cacti / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reconstruction of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splittance of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on the existence of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A congruence theorem for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Le problème d'étoiles pour graphes est NP-complèt / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences Characterizing k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Reconstruction via Distance Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics and graph theory. Proceedings of the Symposium Held at the Indian Statistical Institute, Calcutta, February 25--29, 1980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructibility and perfect graphs / rank
 
Normal rank

Latest revision as of 22:25, 12 July 2024

scientific article
Language Label Description Also known as
English
Reconstructing Cactus Graphs from Shortest Path Information
scientific article

    Statements

    Reconstructing Cactus Graphs from Shortest Path Information (English)
    0 references
    0 references
    0 references
    0 references
    9 November 2016
    0 references
    graph reconstruction
    0 references
    shortest path information
    0 references
    cactus graph
    0 references

    Identifiers