942 search results - page 106 / 189 » Constraints in Graph Drawing Algorithms |
GG
2004
Springer
14 years 3 months ago
2004
Springer
Graphs are well-known, well-understood, and frequently used means to depict networks of related items. They are successfully used as the underlying mathematical concept in various ...
WADS
2007
Springer
14 years 4 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
LATIN
2010
Springer
14 years 4 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
VLDB
1995
ACM
14 years 1 months ago
1995
ACM
: This paper defines a framework for explaining redo recovery after a system crash. In this framework, an installation graph explains the order in which operations must be install...
BIS
2008
13 years 11 months ago
2008
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...