3268 search results - page 386 / 654 » The hub number of a graph |
150
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
195
click to vote
ICSE
1999
IEEE-ACM
15 years 11 months ago
1999
IEEE-ACM
In this paper we show how the FLAVERS data flow analysis technique, originally formulated for programs with the rendezvous model of concurrency, can be applied to concurrent Java...
171
click to vote
RT
1999
Springer
15 years 11 months ago
1999
Springer
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
155
click to vote
FTRTFT
1998
Springer
15 years 10 months ago
1998
Springer
Visual description techniques are particularly important for the design of hybrid systems because specifications of such systems must usually be discussed between engineers from a ...
141
click to vote
ISLPED
1997
ACM
15 years 10 months ago
1997
ACM
We present an algorithm that restructures the state transition graph STG of a sequential circuit so as to reduce power dissipation. The STG is modi ed without changing the behav...