886 search results - page 38 / 178 » Reasoning with contextual graphs |
141
click to vote
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
146
click to vote
BIRTHDAY
2005
Springer
15 years 6 months ago
2005
Springer
Software engineers usually represent problems and solutions aph-based notations at different levels of abstractions. These notations are often semi-formal, but the use of graph tr...
128
click to vote
CONSTRAINTS
1998
15 years 3 months ago
1998
Most current graph layout technology does not lend itself to interactive applications such as animation or advanced user interfaces. We introduce the constrained graph layout model...
114
click to vote
WADS
2001
Springer
15 years 8 months ago
2001
Springer
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
145
click to vote
LICS
2010
IEEE
15 years 1 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...