1736 search results - page 106 / 348 » The rank-width of Directed Graphs |
171
click to vote
KDD
2012
ACM
13 years 6 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
153
click to vote
AIPS
2008
15 years 6 months ago
2008
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
148
click to vote
SIMULATION
2008
15 years 4 months ago
2008
Models of physical systems have to be based on physical principles such as conservation of energy and continuity of power. These principles are inherently enforced by the bond gra...
177
click to vote
AMW
2009
15 years 5 months ago
2009
This paper presents an abstract data model for visualizing RDF data based on the notion of nested graphs. Our study gives theoretical results that shows directions to enhance the r...
121
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a parallel framework of grid-based numerical algorithms where data dependencies between grid zones can be modeled by a directed acyclic graph (DAG). It consist...