1161 search results - page 45 / 233 » Kinetic Dependence Graphs |
113
Voted
IBERAMIA
2010
Springer
14 years 11 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...
61
Voted
DAM
2010
15 years 17 days ago
2010
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...
JCT
2007
15 years 11 days ago
2007
An induced subgraph is called homogeneous if it is either a clique or an independent set. Let hom(G) denote the size of the largest homogeneous subgraph of a graph G. In this shor...
110
Voted
CIAC
1997
Springer
15 years 4 months ago
1997
Springer
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
96
Voted
CORR
2006
Springer
15 years 15 days ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...