68 search results - page 4 / 14 » Open Graphs and Monoidal Theories |
IPL
2007
13 years 6 months ago
2007
Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G...
FCT
2009
Springer
14 years 1 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
JGT
2010
13 years 5 months ago
2010
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
TAGT
1998
Springer
13 years 11 months ago
1998
Springer
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...
KDD
2009
ACM
14 years 7 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...