Sciweavers

1493 search results - page 28 / 299
» Local resilience of graphs
Sort
View
SIBGRAPI
2007
IEEE
14 years 1 months ago
Bipartite graph matching for video clip localization
Video clip localization consists in identifying real positions of a specific video clip in a video stream. To cope with this problem, we propose a new approach considering the ma...
Zenilton Kleber G. do Patrocínio Jr., Silvi...
AIPS
2010
13 years 10 months ago
Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approa...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
JCT
2006
134views more  JCT 2006»
13 years 7 months ago
MacLane's planarity criterion for locally finite graphs
MacLane's planarity criterion states that a finite graph is planar if and only if its cycle space has a basis B such that every edge is contained in at most two members of B....
Henning Bruhn, Maya Jakobine Stein
SIAMDM
2008
86views more  SIAMDM 2008»
13 years 7 months ago
Hamilton Cycles in Planar Locally Finite Graphs
A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable co...
Henning Bruhn, Xingxing Yu
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
14 years 1 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz