A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q237413
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Cristina Bazgan / rank
 
Normal rank
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-319-18173-8_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2181839983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical edges/nodes for the minimum spanning tree problem: complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized approximability of maximizing the spread of influence in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Branching Algorithm for Cluster Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the minimum source-sink path subject to a budget constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Edge Interdiction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On short paths interdiction problems: Total and node-wise limited interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Races in Parameterized Algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The k most vital arcs in the shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster computation of the most vital edge of a shortest path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on Multivariate Algorithmics and Problem Parameterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interdiction Problems on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank

Latest revision as of 18:36, 10 July 2024

scientific article
Language Label Description Also known as
English
A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths
scientific article

    Statements

    A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (English)
    0 references
    0 references
    0 references
    0 references
    21 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references