1420 search results - page 11 / 284 » Representation of Graphs by OBDDs |
ALGORITHMICA
2010
13 years 11 months ago
2010
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...
SPIRE
2007
Springer
14 years 4 months ago
2007
Springer
Compressed graphs representation has become an attractive research topic because of its applications to the manipulation of huge Web graphs in main memory. By far the best current ...
IJCAI
2001
14 years 4 days ago
2001
We propose to extend the temporal causal graph formalisms used in model-based diagnosis in order to deal with non trivial interactions like (partial) cancellation of fault effects...
KES
2008
Springer
13 years 10 months ago
2008
Springer
Bipartite graphs appear in various scenes in the real world, and visualizing these graphs helps improve our understanding of network structures. The amount of information that is a...
SPIRE
2009
Springer
14 years 5 months ago
2009
Springer
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ï...