2125 search results - page 130 / 425 » On Graph Complexity |
GD
2003
Springer
15 years 3 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
EDBT
2008
ACM
15 years 10 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
WG
1998
Springer
15 years 2 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
DAM
2011
14 years 5 months ago
2011
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
FSTTCS
2007
Springer
15 years 4 months ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...