1461 search results - page 74 / 293 » Complexity of Graph Covering Problems |
WSCG
2004
13 years 9 months ago
2004
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...
EVOW
2008
Springer
13 years 9 months ago
2008
Springer
Advances in modern technologies for measuring protein-protein interaction (PPI) has boosted research in PPI networks analysis and comparison. One of the challenging problems in com...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
DISOPT
2007
13 years 7 months ago
2007
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
PODS
2003
ACM
14 years 7 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...