1101 search results - page 62 / 221 » An Algorithm for the Graph Crossing Number Problem |
147
Voted
COLT
2010
Springer
15 years 16 days ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
133
click to vote
ANTSW
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when...
120
click to vote
WALCOM
2010
IEEE
15 years 9 months ago
2010
IEEE
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...
118
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
123
Voted
JCO
2007
15 years 2 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...