3471 search results - page 378 / 695 » Obstacle Numbers of Graphs |
162
click to vote
SODA
1996
ACM
15 years 8 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
180
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
171
Voted
IPL
2006
15 years 6 months ago
2006
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
177
click to vote
EOR
2007
15 years 6 months ago
2007
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
202
click to vote
PAMI
2006
15 years 6 months ago
2006
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...