The complexity of growing a graph (Q6112002): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Temporal vertex cover with a sliding time window / rank
 
Normal rank
Property / cites work
 
Property / cites work: Skip graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique graphs and Helly graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive energy management for incremental deployment of heterogeneous wireless sensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deleting edges to restrict the size of an epidemic in temporal networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster construction of overlay networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-optimal construction of overlay networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4794459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and inference problems for temporal networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity, \(h\)-index, and dynamic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal network optimization subject to connectivity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the transformation capability of feasible mechanisms for programmable matter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computation and Reconfiguration in Actively Dynamic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Local Graph Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Algorithm for Colouring Planar Graphs with Five Colours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active self-assembly of algorithmic shapes and patterns in polylogarithmic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding small separators in temporal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Latest revision as of 12:01, 2 August 2024

scientific article; zbMATH DE number 7722896
Language Label Description Also known as
English
The complexity of growing a graph
scientific article; zbMATH DE number 7722896

    Statements

    The complexity of growing a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 August 2023
    0 references
    temporal graph
    0 references
    cop-win graph
    0 references
    graph process
    0 references
    polynomial-time algorithm
    0 references
    lower bound
    0 references
    NP-complete
    0 references
    hardness result
    0 references

    Identifiers