Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs (Q6087215): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5116470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5075745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5092381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Temporal Paths Under Waiting Time Constraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Clustering and Dynamic Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility Location in Evolving Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deleting edges to restrict the size of an epidemic: a new application for treewidth / 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: Q5092344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5005137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of the minimum shared edges problem / 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 complexity of routing with collision avoidance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistage Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths of bounded length and their cuts: parameterized complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Changing Bases: Multistage Optimization for Matroids and Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental list coloring of graphs, parameterized by conservation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal Network Theory / 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: Enumerating maximal cliques in link streams with durations / 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: Q3740256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding small separators in temporal graphs / rank
 
Normal rank

Revision as of 13:45, 3 August 2024

scientific article; zbMATH DE number 7765401
Language Label Description Also known as
English
Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
scientific article; zbMATH DE number 7765401

    Statements

    0 references
    0 references
    0 references
    0 references
    14 November 2023
    0 references
    temporal graphs
    0 references
    shortest paths
    0 references
    consecutive similarity
    0 references
    consecutive dissimilarity
    0 references
    parameterized complexity
    0 references
    kernelization
    0 references
    representative sets in temporal graphs
    0 references
    Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers