1101 search results - page 14 / 221 » An Algorithm for the Graph Crossing Number Problem |
JUCS
2007
13 years 8 months ago
2007
: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...
GD
2005
Springer
14 years 1 months ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
AUSAI
2003
Springer
14 years 1 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...
APPML
2008
13 years 8 months ago
2008
A saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two staircases from left down to right without any hole inside it. A rook at square (i, j)...