144 search results - page 2 / 29 » Algorithms for the Hypergraph and the Minor Crossing Number ... |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
WG
2005
Springer
13 years 10 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
ACL
1998
13 years 6 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...