389 search results - page 26 / 78 » Some natural decision problems in automatic graphs |
GECCO
2003
Springer
14 years 18 days ago
2003
Springer
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
TAMC
2010
Springer
14 years 13 days ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
INFOVIS
2005
IEEE
14 years 1 months ago
2005
IEEE
The general problem of visualizing “family trees”, or genealogical graphs, in 2D, is considered. A graph theoretic analysis is given, which identifies why genealogical graphs...
ASUNAM
2011
IEEE
12 years 7 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
IEEEARES
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Attack Graphs are an important support for assessment and subsequent improvement of network security. They reveal possible paths an attacker can take to break through se...