1952 search results - page 91 / 391 » Complete partitions of graphs |
132
click to vote
DAC
2004
ACM
16 years 5 months ago
2004
ACM
Previous results show that both flat and hierarchical methodologies present obstacles to effectively completing combinational equivalence checking. A new approach that combines th...
121
click to vote
ENDM
2007
15 years 4 months ago
2007
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
130
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
Graph alliances are recently developed global properties of any symmetric graph. Our purpose in the present paper is to design self-stabilizing fault tolerant distributed algorith...
125
Voted
SIAMDM
2008
15 years 4 months ago
2008
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
134
click to vote
CSR
2008
Springer
15 years 6 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...