Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963096645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-Max Graph Partitioning and Small Set Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of morphisms of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner k-Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing FPT Algorithms for Cut Problems Using Randomized Contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: List H-coloring a graph by removing few vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum bisection is fixed parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multiway Cut Parameterized above Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for counting parameterized list \(H\)-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space complexity of list <i>H</i>-colouring: a dichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the list homomorphism problem for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum feedback sets and multicuts in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi‐arc graphs and the complexity of list homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiway cuts in node weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding topological subgraphs is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding algorithms for a geometric embedding of minimum multiway cut / 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: Parallel Complexity of the Connected Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small separators in linear time via treewidth reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple min-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:53, 13 July 2024

scientific article
Language Label Description Also known as
English
Parameterized algorithms for min-max multiway cut and list digraph homomorphism
scientific article

    Statements

    Parameterized algorithms for min-max multiway cut and list digraph homomorphism (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 May 2017
    0 references
    parameterized complexity
    0 references
    fixed-parameter tractable algorithm
    0 references
    multiway cut
    0 references
    digraph homomorphism
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers