4865 search results - page 342 / 973 » The Complexity of Graph Connectivity |
183
Voted
AIPS
2007
15 years 9 months ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
144
click to vote
FLAIRS
2008
15 years 9 months ago
2008
For many educational applications such as learning tools for argumentation, structured diagrams are a suitable form of external representation. However, student-created graphs pos...
166
Voted
APPINF
2003
15 years 8 months ago
2003
This paper presents an algorithm for recursive data processing in directed graphs. The proposed algorithm applies graph reduction in order to determine both starting points and a ...
197
click to vote
SIMVIS
2004
15 years 8 months ago
2004
We describe a method to match 3D polygonal geometry models using their internal skeleton graphs. These graphs carry information about the overall shape of the model. In order to m...
138
click to vote
COR
2006
15 years 6 months ago
2006
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...