ARSCOM
2006
13 years 4 months ago
2006
MacGillivray and Seyffarth (J. Graph Theory 22 (1996), 213
DM
2008
13 years 4 months ago
2008
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
DM
2008
13 years 4 months ago
2008
: Gould, Jacobson and Lehel (Combinatorics, Graph Theory and Algorithms, Vol.I (1999) 451
AEI
2008
13 years 4 months ago
2008
The paper proposes a methodology to assist the designer at the initial stages of the design synthesis process by enabling him/her to employ knowledge and algorithms existing in gr...
SDM
2008
SIAM
13 years 5 months ago
2008
SIAM
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
ATAL
2006
Springer
13 years 8 months ago
2006
Springer
A multi-agent system can be analyzed and specified as an organization consisting of roles and their relations. The performance of an organization depends on many factors among whi...
TAGT
1994
Springer
13 years 8 months ago
1994
Springer
TAGT
1994
Springer
13 years 8 months ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
TAGT
1994
Springer
13 years 8 months ago
1994
Springer
Graphs are a popular data structure, and graph-manipulation programs are common. Graph manipulations can be cleanly, compactly, and explicitly described using graph-rewriting notat...
TAGT
1998
Springer
13 years 8 months ago
1998
Springer
When working with diagrams in visual environments like graphical diagram editors, diagrams have to be represented by an internal model. Graphs and hypergraphs are well-known concep...