1101 search results - page 53 / 221 » An Algorithm for the Graph Crossing Number Problem |
112
click to vote
FSTTCS
2010
Springer
15 years 14 days ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
133
click to vote
AE
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
131
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
103
click to vote
WG
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
118
click to vote
JOIN
2007
15 years 2 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...