Q5092344 (Q5092344): Difference between revisions

From MaRDI portal
← Older edit
Import240304020342 (talk | contribs)
4,416,906 edits
Set profile property.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.ICALP.2019.141 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The complexity of optimal design of temporally connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal Vertex Cover with a Sliding Time Window / 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: On temporal graph exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5005137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal graph classes: a view through temporal separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / 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: An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling salesman problems in temporal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finding Small Separators in Temporal Graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.ICALP.2019.141 / rank
 
Normal rank

Latest revision as of 15:53, 30 December 2024

scientific article; zbMATH DE number 7561634
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7561634

    Statements

    author
    Erlebach, Thomas
    0 references
    Frank Kammer
    0 references
    Kelin Luo
    0 references
    Andrej Sajenko
    0 references
    Jakob T. Spooner
    0 references
    publication date
    21 July 2022
    0 references
    zbMATH Keywords
    temporal graph exploration
    0 references
    algorithmic graph theory
    0 references
    NP-complete problem
    0 references

    Identifiers

    zbMATH DE Number
    7561634
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5092344&oldid=39529147"
    Powered by MediaWiki