156 search results - page 7 / 32 » The Complexity of the Evolution of Graph Labelings |
ENTCS
2008
13 years 7 months ago
2008
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of th...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
GD
2007
Springer
14 years 1 months ago
2007
Springer
We propose a visualization approach for large dynamic graph structures with high degree variation and low diameter. In particular, we reduce visual complexity by multiple modes of ...
ICCS
1998
Springer
13 years 11 months ago
1998
Springer
Internet-based information technologies have considerable potential for improving collaboration in professional communities. In this paper, we explain the concept of user-driven sp...
CEC
2003
IEEE
14 years 23 days ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...