505 search results - page 7 / 101 » On A Graph Formalism for Ordered Edges |
103
click to vote
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
The paper presents a kernel for learning from ordered hypergraphs, a formalization that captures relational data as used in Inductive Logic Programming (ILP). The kernel generaliz...
153
click to vote
SIAMCOMP
2011
14 years 11 days ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
COMBINATORICA
2008
14 years 9 months ago
2008
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...
APVIS
2004
14 years 11 months ago
2004
Two and a half dimensional graph visualisation is the stacking of a set of related graphs into the third dimension to support visual comparison. A new aesthetic criterion is intro...
154
click to vote
ICITS
2011
14 years 1 months ago
2011
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...