3267 search results - page 111 / 654 » Generalized quasirandom graphs |
JGAA
2007
14 years 11 months ago
2007
Spectral methods are naturally suited for dynamic graph layout because, usually, moderate changes of a graph yield moderate changes of the layout. We discuss some general principl...
ENTCS
2002
14 years 11 months ago
2002
This paper introduces coalgebraic monads as a unified model of term algebras covering fundamental examples such as initial algebras, final coalgebras, rational terms and term grap...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
116
click to vote
BMCBI
2011
14 years 6 months ago
2011
Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state...