Exploration of \(k\)-edge-deficient temporal graphs (Q5896891): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-83508-8_27 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3192232263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The temporal explorer who returns to the base / rank
 
Normal rank
Property / cites work
 
Property / cites work: On exploring always-connected temporal graphs of small pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online and offline algorithms for the time-dependent TSP with time zones / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On temporal graph exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5092344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5005137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-strict Temporal Exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Graphs by Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on distributed exploration of temporal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploration of dynamic tori by multiple agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploration of Constantly Connected Dynamic Graphs Based on Cactuses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring / 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: An Introduction to Temporal Graphs: An Algorithmic Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling salesman problems in temporal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding small separators in temporal graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:05, 28 July 2024

scientific article; zbMATH DE number 7498690
Language Label Description Also known as
English
Exploration of \(k\)-edge-deficient temporal graphs
scientific article; zbMATH DE number 7498690

    Statements

    Exploration of \(k\)-edge-deficient temporal graphs (English)
    0 references
    0 references
    0 references
    25 March 2022
    0 references
    graph algorithms
    0 references
    temporal graphs
    0 references
    graph exploration
    0 references

    Identifiers