2137 search results - page 41 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
128
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
118
click to vote
WEA
2007
Springer
15 years 8 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
105
click to vote
HPCC
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
134
click to vote
AUSAI
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
103
click to vote
WAW
2009
Springer
15 years 8 months ago
2009
Springer
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...