Sciweavers

2463 search results - page 41 / 493
» Rankings of Directed Graphs
Sort
View
IPL
2000
105views more  IPL 2000»
13 years 8 months ago
Coverings that preserve sense of direction
Sense of direction is a property of labelled networks (i.e., arc-coloured graphs) that allows one to assign coherently local identifiers to other processors on the basis of the ro...
Paolo Boldi, Sebastiano Vigna
ICML
2005
IEEE
14 years 9 months ago
Learning from labeled and unlabeled data on a directed graph
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...
Bernhard Schölkopf, Dengyong Zhou, Jiayuan Hu...
WG
2009
Springer
14 years 3 months ago
Chordal Digraphs
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed ...
Daniel Meister, Jan Arne Telle
WEA
2004
Springer
110views Algorithms» more  WEA 2004»
14 years 2 months ago
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
David J. Pearce, Paul H. J. Kelly
SIROCCO
2000
13 years 10 months ago
Lower bounds for (weak) sense of direction
A graph with n vertices and maximum degree cannot be given weak sense of direction using less than colours. It is known that n colours are always sufficient, but it has been conje...
Paolo Boldi, Sebastiano Vigna