1949 search results - page 202 / 390 » Random graphs on surfaces |
142
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
142
click to vote
FLAIRS
2004
15 years 6 months ago
2004
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
121
click to vote
COMBINATORICS
2007
15 years 5 months ago
2007
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
200
Voted
ENDM
2000
15 years 4 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
140
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...