Sciweavers

1756 search results - page 53 / 352
» Directed scale-free graphs
Sort
View
APVIS
2004
13 years 9 months ago
Inhomogeneous Force-Directed Layout Algorithms in the Visualisation Pipeline: From Layouts to Visualisations
The visualisation pipeline approach is a flexible and extensible technique for generating visualisations. The basic pipeline functions involve the capture and representation of da...
Neville Churcher, Warwick Irwin, Carl Cook
DM
1998
57views more  DM 1998»
13 years 7 months ago
Note on alternating directed cycles
The problem of the existence of an alternating simple dicycle in a 2-arc-coloured digraph is considered. This is a generalization of the alternating cycle problem in 2-edgecoloure...
Gregory Gutin, Benny Sudakov, Anders Yeo
GD
2005
Springer
14 years 1 months ago
Applications of Parameterized st-Orientations in Graph Drawing Algorithms
Abstract. Many graph drawing algorithms use st-numberings (st-orientations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a d...
Charalampos Papamanthou, Ioannis G. Tollis
CINQ
2004
Springer
182views Database» more  CINQ 2004»
13 years 11 months ago
Mining Constrained Graphs: The Case of Workflow Systems
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
Gianluigi Greco, Antonella Guzzo, Giuseppe Manco, ...
AMC
2008
78views more  AMC 2008»
13 years 8 months ago
Information processing in complex networks: Graph entropy and information functionals
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
Matthias Dehmer