Sciweavers

1756 search results - page 93 / 352
» Directed scale-free graphs
Sort
View
WEBI
2001
Springer
14 years 13 days ago
Average-Clicks: A New Measure of Distance on the World Wide Web
The pages and hyperlinks of the World Wide Web may be viewed as nodes and edges in a directed graph. In this paper, we propose a new definition of the distance between two pages, ...
Yutaka Matsuo, Yukio Ohsawa, Mitsuru Ishizuka
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
14 years 3 days ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
14 years 1 days ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
CSCLP
2006
Springer
13 years 11 months ago
A Constraint Model for State Transitions in Disjunctive Resources
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
Roman Barták, Ondrej Cepek
ICALP
2010
Springer
13 years 11 months ago
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
Loukas Georgiadis