4865 search results - page 235 / 973 » The Complexity of Graph Connectivity |
119
click to vote
IWPC
2010
IEEE
15 years 3 months ago
2010
IEEE
We present a tool that identifies complex data-flow dependencies on code-level, based on the measure dep-degree. Low-level dependencies between program operations are modeled by...
145
click to vote
WAIM
2010
Springer
15 years 3 months ago
2010
Springer
We present HyperGraphDB, a novel graph database based on generalized hypergraphs where hyperedges can contain other hyperedges. This generalization automatically reifies every ent...
177
click to vote
COCOON
2007
Springer
15 years 11 months 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...
120
Voted
JCDL
2003
ACM
15 years 10 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...
DM
2007
15 years 5 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...