Sciweavers

225 search results - page 16 / 45
» From polynomial time queries to graph structure theory
Sort
View
ECCC
2008
122views more  ECCC 2008»
15 years 6 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira
ICPR
2008
IEEE
16 years 15 days ago
Object recognition using graph spectral invariants
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
Bai Xiao, Richard C. Wilson, Edwin R. Hancock
CIKM
2008
Springer
15 years 8 months ago
Dr. Searcher and Mr. Browser: a unified hyperlink-click graph
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
Barbara Poblete, Carlos Castillo, Aristides Gionis
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
13 years 8 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
STACS
2010
Springer
16 years 1 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...