1101 search results - page 70 / 221 » An Algorithm for the Graph Crossing Number Problem |
158
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
139
Voted
ICML
2004
IEEE
16 years 3 months ago
2004
IEEE
We propose a fast iterative classification algorithm for Kernel Fisher Discriminant (KFD) using heterogeneous kernel models. In contrast with the standard KFD that requires the us...
134
Voted
SIAMCOMP
2010
15 years 1 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
131
click to vote
RSA
2008
15 years 2 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
134
click to vote
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...