A faster FPT algorithm for bipartite contraction (Q2445333): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
A Faster FPT Algorithm for Bipartite Contraction
description / endescription / en
scientific article
scientific article; zbMATH DE number 6237067
Property / title
 
A Faster FPT Algorithm for Bipartite Contraction (English)
Property / title: A Faster FPT Algorithm for Bipartite Contraction (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1407.68536 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-03898-8_16 / rank
 
Normal rank
Property / published in
 
Property / published in: Parameterized and Exact Computation / rank
 
Normal rank
Property / publication date
 
10 December 2013
Timestamp+2013-12-10T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 10 December 2013 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6237067 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1832264756 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2568037855 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1305.2743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for feedback vertex set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved parameterized algorithm for the minimum node multiway cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed-parameter algorithm for the directed feedback vertex set problem / 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: On group feedback vertex set parameterized by the size of the cutset / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining Planarity by Contracting Few Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT algorithms for path-transversal and cycle-transversal problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contracting graphs to paths and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2911626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity Allowing Few Error Vertices in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Parameterized Algorithms Using Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Parameterized Algorithm for OCT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal deletion is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining a planar graph by vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring Indifference: Unit Interval Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper interval vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Completion Is Fixed Parameter Tractable / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:08, 8 July 2024

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
  • A Faster FPT Algorithm for Bipartite Contraction

Statements

A faster FPT algorithm for bipartite contraction (English)
0 references
A Faster FPT Algorithm for Bipartite Contraction (English)
0 references
0 references
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 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references