Home Issues About JGAA Instructions for Authors
 
JGAA Volumes
Volume 11, no. 1, 2007
DOI: 10.7155/jgaa.00135
Building Blocks of Upward Planar Digraphs
Patrick Healy and Karol Lynch
Vol. 11, no. 1, pp. 3-44, 2007. Regular paper.
DOI: 10.7155/jgaa.00136
Bar k-Visibility Graphs
Vol. 11, no. 1, pp. 45-59, 2007. Regular paper.
DOI: 10.7155/jgaa.00137
The Traveling Salesman Problem for Cubic Graphs
Vol. 11, no. 1, pp. 61-81, 2007. Regular paper.
DOI: 10.7155/jgaa.00138
Equi-partitioning of Higher-dimensional Hyper-rectangular Grid Graphs
Vol. 11, no. 1, pp. 83-98, 2007. Regular paper.
DOI: 10.7155/jgaa.00139
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
Donatello Conte, Pasquale Foggia, and Mario Vento
Vol. 11, no. 1, pp. 99-143, 2007. Regular paper.
DOI: 10.7155/jgaa.00140
Fixed-Location Circular Arc Drawing of Planar Graphs
Vol. 11, no. 1, pp. 145-164, 2007. Regular paper.
DOI: 10.7155/jgaa.00141
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
Vol. 11, no. 1, pp. 165-193, 2007. Regular paper.
DOI: 10.7155/jgaa.00142
Estimating the Number of s-t Paths in a Graph
Vol. 11, no. 1, pp. 195-214, 2007. Regular paper.
DOI: 10.7155/jgaa.00143
Simultaneous Border Segmentation of Doughnut-Shaped Objects in Medical Images
Vol. 11, no. 1, pp. 215-237, 2007. Regular paper.
DOI: 10.7155/jgaa.00144
Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time
Vol. 11, no. 1, pp. 239-257, 2007. Regular paper.
DOI: 10.7155/jgaa.00145
Planar Embeddings of Graphs with Specified Edge Lengths
Vol. 11, no. 1, pp. 259-276, 2007. Regular paper.
DOI: 10.7155/jgaa.00146
Specific Selection of FFT Amplitudes from Audio Sports and News Broadcasting for Classification Purposes
Vol. 11, no. 1, pp. 277-307, 2007. Regular paper.
DOI: 10.7155/jgaa.00147
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Vol. 11, no. 1, pp. 309-319, 2007. Regular paper.