150 search results - page 10 / 30 » Polynomial graph invariants from homomorphism numbers |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
COMGEO
2010
ACM
14 years 9 months ago
2010
ACM
We use Bernstein's Theorem [1] to obtain combinatorial bounds for the number of embeddings of Laman graph frameworks modulo rigid motions. For this, we study the mixed volume...
COMBINATORICS
2007
14 years 9 months ago
2007
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
IVC
2000
14 years 9 months ago
2000
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
CIKM
2009
Springer
15 years 2 months ago
2009
Springer
Answering queries using views is a well-established technique in databases. In this context, two outstanding problems can be formulated. The first one consists in deciding whethe...