On finding separators in temporal split and permutation graphs (Q5925700): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2023.01.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3164856871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / 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: Edge exploration of temporal graphs / 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: Improved upper bounds for vertex cover / 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: Assigning times to minimise reachability in temporal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On temporal graph exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation Graphs and Transitive Graphs / 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: As Time Goes By: Reflections on Treewidth for Temporal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback edge sets in temporal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Split Completions of Graphs / 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: A NEW MEASURE OF RANK CORRELATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding separators in temporal split and permutation 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: The complexity of finding temporal separators under waiting time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards classifying the polynomial-time solvability of temporal betweenness centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a graph partition problem with application to VLSI layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster parameterized algorithm for temporal matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding small separators in temporal graphs / rank
 
Normal rank

Latest revision as of 23:09, 31 July 2024

scientific article; zbMATH DE number 7677364
Language Label Description Also known as
English
On finding separators in temporal split and permutation graphs
scientific article; zbMATH DE number 7677364

    Statements

    On finding separators in temporal split and permutation graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 April 2023
    0 references
    temporal graphs
    0 references
    connectivity problems
    0 references
    special graph classes
    0 references
    NP-hardness
    0 references
    fixed-parameter tractability
    0 references
    0 references
    0 references
    0 references

    Identifiers