An Introduction to Temporal Graphs: An Algorithmic Perspective (Q3464477): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1881841366 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1503.00278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DMVP: Foremost Waypoint Coverage of Time-Varying Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation in networks of passively mobile finite-state sensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossips and telephones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many or few colors in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4659605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flooding time in edge-Markovian dynamic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication in dynamic radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On temporal graph exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient continuous-time dynamic network flow algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploration of Periodically Varying Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Rounding Approach to the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Information Dissemination in Dynamic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic graph models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of gossiping and broadcasting in communication networks / 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: Distance oracles for time-dependent networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum label spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computation in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Treewidth of Dynamic Graphs / 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: Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mediated population protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Naming and Counting in Anonymous Unknown Dynamic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Causality, influence, and computation in possibly disconnected synchronous dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and efficient local codes for distributed stable network construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling Salesman Problems in Temporal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring and the probabilistic method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The labeled perfect matching in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem with Distances One and Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Spreading a Rumor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Matching Problems for Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS / rank
 
Normal rank

Latest revision as of 08:56, 11 July 2024

scientific article
Language Label Description Also known as
English
An Introduction to Temporal Graphs: An Algorithmic Perspective
scientific article

    Statements

    An Introduction to Temporal Graphs: An Algorithmic Perspective (English)
    0 references
    0 references
    27 January 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers