A faster FPT algorithm for bipartite contraction (Q2445333)
From MaRDI portal
(Redirected from Item:Q2867082)
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A faster FPT algorithm for bipartite contraction |
scientific article; zbMATH DE number 6237067
- A Faster FPT Algorithm for Bipartite Contraction
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster FPT algorithm for bipartite contraction |
scientific article; zbMATH DE number 6237067 |
|
Statements
A faster FPT algorithm for bipartite contraction (English)
0 references
A Faster FPT Algorithm for Bipartite Contraction (English)
0 references
14 April 2014
0 references
10 December 2013
0 references
graph algorithms
0 references
randomized algorithms
0 references
fixed-parameter tractability
0 references
graph modification problems
0 references
0 references
0 references
0 references
0 references
0.9977939128875732
0 references
0.8612247705459595
0 references
0.8082594871520996
0 references
0.8057694435119629
0 references