3008 search results - page 181 / 602 » Independence in connected graphs |
199
click to vote
COCOON
2007
Springer
16 years 21 days ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
140
click to vote
JCDL
2003
ACM
15 years 11 months ago
2003
ACM
This paper presents a new technique for dealing with broken characters, one of the major challenges in the optical character recognition (OCR) of degraded historical printed docum...
112
click to vote
DM
2007
15 years 6 months ago
2007
By a regular embedding of a graph K into a surface we mean a 2-cell embedding of K into a compact connected surface with the automorphism group acting regularly on flags. Regular...
176
click to vote
NETWORKS
2008
15 years 6 months ago
2008
We present a new efficient approach for solving the multicommodity flow problem as a sequence of subproblems, each on a very sparse but connected network. We show that each subpro...
179
click to vote
DATE
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract - Streaming applications are often implemented as task graphs. Currently, techniques exist to derive buffer capacities that guarantee satisfaction of a throughput constrai...