505 search results - page 25 / 101 » On A Graph Formalism for Ordered Edges |
78
Voted
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
In ranking, one is given examples of order relationships among objects, and the goal is to learn from these examples a real-valued ranking function that induces a ranking or order...
FMCO
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This tutorial paper describes a framework for modelling several aspects of distributed computing based on Synchronised Hyperedge Replacement (SHR), a graph rewriting form...
EJC
2007
14 years 9 months ago
2007
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
JGT
2008
14 years 9 months ago
2008
: We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to sho...
159
click to vote
GC
2011
Springer
14 years 4 months ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...