3220 search results - page 274 / 644 » Constrained Graph Processes |
180
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
183
click to vote
AIPS
2000
15 years 8 months ago
2000
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...
146
click to vote
GD
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
180
click to vote
PVLDB
2010
15 years 5 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
182
click to vote
ICDAR
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...