Two Hardness Results on Feedback Vertex Sets (Q3004674)

From MaRDI portal

Revision as of 02:35, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

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

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Two Hardness Results on Feedback Vertex Sets	scientific article

Statements

scholarly article

0 references

Two Hardness Results on Feedback Vertex Sets (English)

0 references

0 references

0 references

0 references

0 references

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

0 references

publication date

3 June 2011

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-21204-8_26

0 references

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

0 references

0 references

0 references

An Approximation Algorithm for Feedback Vertex Sets in Tournaments

0 references

A Min-Max Theorem on Feedback Vertex Sets

0 references

On Feedback Vertex Set New Measure and New Structures

0 references

New bounds on the size of the minimum feedback vertex set in meshes and butterflies.

0 references

Improved algorithms for feedback vertex set problems

0 references

A fixed-parameter algorithm for the directed feedback vertex set problem

0 references

0 references

0 references

On the minimum feedback vertex set problem: Exact and enumeration algorithms

0 references

Finding Induced Subgraphs via Minimal Triangulations

0 references

Feedback vertex set in hypercubes

0 references

On the independence number of random graphs

0 references

Minimum weight feedback vertex sets in circle graphs

0 references

0 references

A Graph Theoretic Approach to Statistical Data Security

0 references

Feedback Vertex Sets in Rotator Graphs

0 references

Tractable Feedback Vertex Sets in Restricted Bipartite Graphs

0 references

Probability and Computing

0 references

An efficient algorithm for minimum feedback vertex sets in rotator graphs

0 references

Minimum feedback vertex sets in shuffle-based interconnection networks

0 references

A linear-time algorithm for the weighted feedback vertex problem on interval graphs

0 references

Almost exact minimum feedback vertex set in meshes and butterflies

0 references

Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies

0 references

Improved approximation algorithm for the feedback set problem in a bipartite tournament

0 references

Feedback vertex sets in star graphs

0 references

0 references

Many hard examples in exact phase transitions

0 references

Random constraint satisfaction: easy generation of hard (satisfiable) instances

0 references

Node-Deletion Problems on Bipartite Graphs

0 references

0 references

Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-21204-8_26

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3004674

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