396 search results - page 20 / 80 » Exact Algorithms for Graph Homomorphisms |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
CPC
2006
13 years 9 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
APPROX
2004
Springer
14 years 2 months ago
2004
Springer
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
We introduce the concept of multi-directional width-bounded geometric separator and get improved separator for the grid graph, which improves exact algorithm for the protein foldin...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...