4865 search results - page 166 / 973 » The Complexity of Graph Connectivity |
171
click to vote
ICPR
2008
IEEE
16 years 27 days ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
162
click to vote
COMGEO
2010
ACM
15 years 6 months ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
173
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
172
click to vote
AAAI
2008
15 years 8 months ago
2008
We consider a multiagent extension of single-agent graph coloring. Multiple agents hold disjoint autonomous subgraphs of a global graph, and every color used by the agents in colo...
143
click to vote
AIPS
2008
15 years 8 months ago
2008
The causal graph is a directed graph that describes the variable dependencies present in a planning instance. A number of papers have studied the causal graph in both practical an...