945 search results - page 29 / 189 » Graph Types |
105
click to vote
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
95
Voted
ICPR
2004
IEEE
16 years 2 months ago
2004
IEEE
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
112
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
DM
2007
15 years 1 months ago
2007
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
106
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
d Abstract) N. Alon ∗ M. Capalbo † July 28, 2002 Using a new recursive technique, we present an explicit construction of an infinite family of N-superconcentrators of density...