Sciweavers

5100 search results - page 66 / 1020
» The Linear Complexity of a Graph
Sort
View
PAMI
2007
176views more  PAMI 2007»
13 years 7 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
ECCC
2007
124views more  ECCC 2007»
13 years 7 months ago
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
Artur Czumaj, Asaf Shapira, Christian Sohler
CPM
2007
Springer
78views Combinatorics» more  CPM 2007»
14 years 2 months ago
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics
Guillaume Fertin, Danny Hermelin, Romeo Rizzi, St&...