Sciweavers

721 search results - page 72 / 145
» Almost universal graphs
Sort
View
GD
2009
Springer
13 years 7 months ago
On Open Problems in Biological Network Visualization
Much of the data generated and analyzed in the life sciences can be interpreted and represented by networks or graphs. Network analysis and visualization methods help in investigat...
Mario Albrecht, Andreas Kerren, Karsten Klein, Oli...
STACS
1998
Springer
14 years 2 months ago
Random Sparse Bit Strings at the Threshold of Adjacency
d Abstract appeared in STACS `98) Joel H. Spencer1 and Katherine St. John2 1 Courant Institute, New York University, New York, NY 10012 2 Department of Mathematics, Santa Clara Uni...
Joel Spencer, Katherine St. John
DAM
1999
132views more  DAM 1999»
13 years 9 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian
SIGSOFT
2003
ACM
14 years 3 months ago
Modeling and validation of service-oriented architectures: application vs. style
Most applications developed today rely on a given middleware platform which governs the interaction between components, the access to resources, etc. To decide, which platform is ...
Luciano Baresi, Reiko Heckel, Sebastian Thöne...
COCOA
2007
Springer
14 years 4 months ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...