1736 search results - page 107 / 348 » The rank-width of Directed Graphs |
111
click to vote
CPM
2004
Springer
15 years 9 months ago
2004
Springer
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
124
click to vote
WEBI
2001
Springer
15 years 8 months ago
2001
Springer
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, ...
165
click to vote
ISAAC
1993
Springer
15 years 8 months ago
1993
Springer
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...
163
click to vote
AAIM
2007
Springer
15 years 8 months ago
2007
Springer
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...
129
click to vote
CSCLP
2006
Springer
15 years 8 months ago
2006
Springer
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...