Combinatorial network abstraction by trees and distances (Q954979): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982160332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network analysis. Methodological foundations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of minimum spanner problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of spanning tree problems: Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are planar graphs almost as good as the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAD trees and distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree spanners in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum diameter spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low complexity variants of the arrow distributed directory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance approximating spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The centrality index of a graph / rank
 
Normal rank

Latest revision as of 19:32, 28 June 2024

scientific article
Language Label Description Also known as
English
Combinatorial network abstraction by trees and distances
scientific article

    Statements

    Combinatorial network abstraction by trees and distances (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 November 2008
    0 references
    network abstraction
    0 references
    spanning trees
    0 references
    matrix norms
    0 references
    NP-completeness
    0 references
    inapproximability
    0 references

    Identifiers

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