311 search results - page 17 / 63 » Graph Classes Between Parity and Distance-hereditary Graphs |
HICSS
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper presents a graph transformation based approach to design pattern evolution. An evolution of a design pattern includes modifications of pattern elements, such as classes...
EVOW
2009
Springer
14 years 2 months ago
2009
Springer
We present a hybrid evolutionary algorithm for the graph coloring problem (Evocol). Evocol is based on two simple-but-effective ideas. First, we use an enhanced crossover that col...
DM
2000
13 years 7 months ago
2000
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...
IBERAMIA
2010
Springer
13 years 6 months ago
2010
Springer
We define a class of graphs that summarize in a compact visual way the interaction structure between binary multivariate characteristics. This allows studying the conditional depe...
WG
1998
Springer
13 years 11 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...