406 search results - page 4 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
110
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
118
click to vote
ALGORITHMICA
2008
14 years 11 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
SOFSEM
2009
Springer
15 years 8 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
BMCBI
2008
14 years 11 months ago
2008
Background: Prediction of disulfide bridges from protein sequences is useful for characterizing structural and functional properties of proteins. Several methods based on differen...