11 search results - page 1 / 3 » Small Induced-Universal Graphs and Compact Implicit Graph Re... |
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
ALENEX
2004
13 years 6 months ago
2004
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
CORR
2012
Springer
12 years 23 days ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
ICCAD
1999
IEEE
13 years 9 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...