The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383): 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 / OpenAlex ID
 
Property / OpenAlex ID: W4311374588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths and trails in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Paths Avoiding Forbidden Subpaths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed 2-linkage problem with length constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating codes and traffic monitoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum connecting transition sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Directed Disjoint Shortest Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Detours is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Hamiltonian cycles in $2$-edge-colored multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits determining the order of chromosomes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-factors in orientated graphs with forbidden transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / 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: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Applications of Tree-Cut Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of cut-based parameters for computing edge disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undirected two disjoint shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of trails, paths and circuits in arc-colored digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On s-t paths and trails in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating cycles in edge-partitioned graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly Coloured Cycles and Paths: Results and Open Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chinese postman problem on edge-colored multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees in Graphs with Conflict Edges or Forbidden Transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Paths in Grids with Forbidden Transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPT 2-approximation for tree-cut decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two disjoint shortest paths problem with non-negative edge length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle extension in edge-colored complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly edge-colored theta graphs in edge-colored complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Immersions in Highly Edge Connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths in graphs avoiding forbidden transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of graphs not admitting a fixed immersion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on alternating cycles in edge-coloured graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hamiltonian Cycle in Graphs of Bounded Treewidth / rank
 
Normal rank

Latest revision as of 00:43, 1 August 2024

scientific article
Language Label Description Also known as
English
The complexity of routing problems in forbidden-transition graphs and edge-colored graphs
scientific article

    Statements

    The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2023
    0 references
    graph algorithms
    0 references
    fixed-parameter tractability
    0 references
    parameterized complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers