1736 search results - page 335 / 348 » The rank-width of Directed Graphs |
169
click to vote
ICWL
2004
Springer
15 years 10 months ago
2004
Springer
This paper describes a system for the animation of algorithms on an electronic chalkboard. The instructor teaching an algorithm can enter data directly through a drawing- the algor...
161
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
169
click to vote
RT
2004
Springer
15 years 10 months ago
2004
Springer
Pixels store a digital image as a grid of point samples that can reconstruct a limited-bandwidth continuous 2-D source image. Although convenient for anti-aliased display, these b...
152
click to vote
TACAS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
139
click to vote
VLDB
2004
ACM
15 years 10 months ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...