No label defined (Q5743513)

From MaRDI portal

Revision as of 05:14, 19 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 7053389

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7053389

Statements

scholarly article

0 references

Naonori Kakimura

0 references

Ken-ichi Kawarabayashi

0 references

Yusuke Kobayashi

0 references

publication date

10 May 2019

0 references

full work available at URL

https://dl.acm.org/citation.cfm?id=2095253

0 references

zbMATH Keywords

Erdős-Pósa theorem

0 references

parameterized complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

Linear time algorithms for NP-hard problems restricted to partial k- trees

0 references

A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

0 references

Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference

0 references

A Min-Max Theorem on Feedback Vertex Sets

0 references

Packing cycles in undirected graphs

0 references

A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs

0 references

Subset Feedback Vertex Set Is Fixed-Parameter Tractable

0 references

Fundamentals of parameterized complexity

0 references

0 references

0 references

Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$

0 references

A polyhedral approach to the feedback vertex set problem

0 references

On the odd-minor variant of Hadwiger's conjecture

0 references

Algorithms and Data Structures

0 references

Packing cycles through prescribed vertices under modularity constraints

0 references

Packing cycles through prescribed vertices

0 references

Fixed-parameter tractability for subset feedback set problems with parity constraints

0 references

Reducibility among Combinatorial Problems

0 references

Rooted minor problems in highly connected graphs

0 references

On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture

0 references

Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem

0 references

The disjoint paths problem in quadratic time

0 references

0 references

Odd cycle packing

0 references

The Graph Minor Algorithm with Parity Conditions

0 references

Approximation algorithms and hardness results for cycle packing problems

0 references

Disjoint cycles intersecting a set of vertices

0 references

Mangoes and blueberries

0 references

Finding odd cycle transversals.

0 references

Graph minors. XIII: The disjoint paths problem

0 references

Graph minors. XXII. Irrelevant vertices in linkage problems

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

Disjoint paths in graphs

0 references

A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits

0 references

2-linked graphs

0 references

On the presence of disjoint subgraphs of a specified type

0 references

Packing cycles with modularity constraints

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5743513

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5743513&oldid=36492166"