1951 search results - page 149 / 391 » An algorithm for improving graph partitions |
168
click to vote
ICANNGA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The use of support vector machines for multi-category problems is still an open field to research. Most of the published works use the one-against-rest strategy, but with...
140
click to vote
COMAD
2009
15 years 6 months ago
2009
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
156
Voted
GD
2008
Springer
15 years 6 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
156
Voted
ALGORITHMICA
2011
14 years 12 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
166
click to vote
SIROCCO
2007
15 years 6 months ago
2007
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...