3471 search results - page 6 / 695 » Obstacle Numbers of Graphs |
114
click to vote
COMGEO
2011
ACM
14 years 4 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
GC
2007
Springer
14 years 9 months ago
2007
Springer
A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m ...
67
Voted
INFORMATICALT
2006
14 years 9 months ago
2006
An algorithm for scheduling the trajectory of a point object, which moves on a plane surface comprising of moving obstacles, is introduced. Different quantitative criteria may be m...
ICCAD
1999
IEEE
15 years 1 months ago
1999
IEEE
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
79
Voted
SPDP
1991
IEEE
15 years 28 days ago
1991
IEEE
This paper presents several techniques for adding fault-tolerance to distributed memory parallel computers. More formally, given a target graph with n nodes, we create a fault-tol...