Sciweavers

1883 search results - page 72 / 377
» Ordered theta graphs
Sort
View
FOSSACS
2009
Springer
14 years 2 months ago
Separating Graph Logic from MSO
Abstract. Graph logic (GL) is a spatial logic for querying graphs introduced by Cardelli et al. It has been observed that in terms of expressive power, this logic is a fragment of ...
Timos Antonopoulos, Anuj Dawar
GBRPR
2007
Springer
14 years 1 months ago
Grouping Using Factor Graphs: An Approach for Finding Text with a Camera Phone
Abstract. We introduce a new framework for feature grouping based on factor graphs, which are graphical models that encode interactions among arbitrary numbers of random variables....
Huiying Shen, James Coughlan
BMVC
2001
13 years 10 months ago
Graph Matching using Adjacency Matrix Markov Chains
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
Antonio Robles-Kelly, Edwin R. Hancock
CORR
2004
Springer
94views Education» more  CORR 2004»
13 years 7 months ago
Track Layouts of Graphs
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
Vida Dujmovic, Attila Pór, David R. Wood
FOCS
2009
IEEE
14 years 2 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi