5889 search results - page 412 / 1178 » Graph Layout Problems |
196
Voted
ECCC
2000
15 years 6 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
184
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
237
Voted
ICDAR
2011
IEEE
14 years 6 months ago
2011
IEEE
—Handwritten text line segmentation on real-world data presents significant challenges that cannot be overcome by any single technique. Given the diversity of approaches and the...
176
click to vote
CP
2005
Springer
16 years 12 days ago
2005
Springer
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
169
click to vote
APWEB
2010
Springer
15 years 11 months ago
2010
Springer
—Extensive research has been conducted on top of online social networks (OSNs), while little attention has been paid to the data collection process. Due to the large scale of OSN...