Fixed-parameter tractable algorithms for tracking shortest paths (Q2210499): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Fixed-parameter tractable algorithms for tracking set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tracking Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying vertex covers in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chain packing in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and approximation complexity of \textsc{Partial VC Dimension} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Study of the Test Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4502621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a new class of codes for identifying vertices in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tracking routes in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Algorithms for Tracking Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kernelization algorithm for \(d\)-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient fixed-parameter algorithm for 3-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the test cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Non-)existence of polynomial kernels for the test cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizations of test cover with bounded test sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above Guaranteed Values: MaxSat and MaxCut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above or below guaranteed values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for (r,l)-Partization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank

Revision as of 23:39, 23 July 2024

scientific article
Language Label Description Also known as
English
Fixed-parameter tractable algorithms for tracking shortest paths
scientific article

    Statements

    Fixed-parameter tractable algorithms for tracking shortest paths (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 November 2020
    0 references
    graphs
    0 references
    shortest \(s\)-\(t\) paths
    0 references
    tracking paths
    0 references
    fixed-parameter tractable
    0 references
    kernel
    0 references
    set systems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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