Sciweavers

3105 search results - page 152 / 621
» The Path-Packing Structure of Graphs
Sort
View
SAT
2004
Springer
85views Hardware» more  SAT 2004»
15 years 11 months ago
Visualizing the Internal Structure of SAT Instances (Preliminary Report)
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
Carsten Sinz
SWAT
2004
Springer
146views Algorithms» more  SWAT 2004»
15 years 11 months ago
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
Gerth Stølting Brodal, Rolf Fagerberg, Ulri...
SIGCSE
1998
ACM
107views Education» more  SIGCSE 1998»
15 years 10 months ago
Web-based animation of data structures using JAWAA
JAWAA is a simple command language for creating animations of data structures and displaying them with a Web browser. Commands are stored in a script file that is retrieved and r...
Willard C. Pierson, Susan H. Rodger
ISMB
1997
15 years 7 months ago
Automated Alignment of RNA Sequences to Pseudoknotted Structures
Seq7 is a newprogramfor generating multiple structure-based alignments of RNAsequences. Byusing a variant of Dijkstra’s algorithm to find the shortest path through a specially c...
Jack E. Tabaska, Gary D. Stormo
AUTOMATICA
2007
92views more  AUTOMATICA 2007»
15 years 6 months ago
Observability analysis for structured bilinear systems: A graph-theoretic approach
This paper is devoted to the generic observability analysis for structured bilinear systems using a graph-theoretic approach. On the basis of a digraph representation, we express ...
T. Boukhobza, Frédéric Hamelin