Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
2
views
9
references
Top references
cited by
0
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
5,292
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Parameterized and Exact Computation
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
other
Author(s):
Gregory Gutin
,
Eun Jung Kim
,
Arezou Soleimanfallah
,
Stefan Szeider
,
Anders Yeo
Publication date
(Print):
2010
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Smart Contracts Programming Languages
Most cited references
9
Record
: found
Abstract
: not found
Book
: not found
Parameterized Complexity
R. G. Downey
,
M. Fellows
(1999)
0
comments
Cited
255
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Invitation to Fixed-Parameter Algorithms
Rolf Niedermeier
(2006)
0
comments
Cited
95
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
Krzysztof Pietrzak
(2003)
0
comments
Cited
30
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2010
Pages
: 158-169
DOI:
10.1007/978-3-642-17493-3_16
SO-VID:
32ec4a73-3e42-4e8d-9abe-6e136441e7b0
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
The Complexity of Satisfaction on Sparse Graphs
pp. 3
Protrusions in Graphs and Their Applications
pp. 4
Parameterized Complexity Results in Symmetry Breaking
pp. 14
On the Kernelization Complexity of Colorful Motifs
pp. 26
Partial Kernelization for Rank Aggregation: Theory and Experiments
pp. 38
Enumerate and Measure: Improving Parameter Budget Management
pp. 50
On the Exact Complexity of Evaluating Quantified k-CNF
pp. 60
Cluster Editing: Kernelization Based on Edge Cuts
pp. 72
Computing the Deficiency of Housing Markets with Duplicate Houses
pp. 84
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application
pp. 95
An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion
pp. 107
Multivariate Complexity Analysis of Swap Bribery
pp. 123
Parameterizing by the Number of Numbers
pp. 135
Are There Any Good Digraph Width Measures?
pp. 147
On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
pp. 158
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
pp. 170
On the Grundy Number of a Graph
pp. 180
Exponential Time Complexity of Weighted Counting of Independent Sets
pp. 192
The Exponential Time Complexity of Computing the Probability That a Graph Is Connected
pp. 204
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
pp. 216
Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier
pp. 228
Proper Interval Vertex Deletion
Similar content
5,292
Efficient verification of bipartite pure states
Authors:
Zhao Li
,
Z. Li
,
YH Han
…
MRI findings in bipartite patella.
Authors:
Adam Zoga
,
Imran M Omar
,
Stephanie M Ford
…
Complementation of bipartite begomovirus movement functions by topocuviruses and curtoviruses.
Authors:
P Markham
,
Rob Briddon
See all similar