Sciweavers

5473 search results - page 124 / 1095
» On the graph isomorphism problem
Sort
View
ESA
2005
Springer
162views Algorithms» more  ESA 2005»
16 years 12 days ago
Minimal Interval Completions
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve...
MFCS
1992
Springer
15 years 11 months ago
The Complexity of Graph Connectivity
In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging op...
Avi Wigderson
LICS
2005
IEEE
16 years 14 days ago
Model-Checking Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Markus Lohrey
SIAMCOMP
2011
15 years 1 months ago
A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product
Reingold, Vadhan and Wigderson [21] introduced the graph zig-zag product. This product combines a large graph and a small graph into one graph, such that the resulting graph inher...
Avraham Ben-Aroya, Amnon Ta-Shma
ICPR
2008
IEEE
16 years 8 months ago
Nonlocal graph regularization for image colorization
In this paper we present a simple colorization method that relies on nonlocal graph regularization. We introduce nonlocal discrete differential operators and a family of weighted ...
Abderrahim Elmoataz, Olivier Lezoray, Vinh-Thong T...