1321 search results - page 95 / 265 » Quadratic forms on graphs |
WG
2009
Springer
15 years 4 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
ASYNC
1997
IEEE
15 years 2 months ago
1997
IEEE
This paper introduces a novel technique for synthesis of speed-independent circuits from their Signal Transition Graph specifications. The new method uses partial order in the fo...
HCI
2007
14 years 11 months ago
2007
Coupling is the action of binding two entities so that they can operate together to provide new functions. In this article, we propose a formal definition for coupling and present ...
NIPS
2008
14 years 11 months ago
2008
We present a characterization of a useful class of skills based on a graphical representation of an agent's interaction with its environment. Our characterization uses betwee...
JCT
2006
14 years 9 months ago
2006
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....