Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Journal of Graph Algorithms and Applications
Tome 11 (2007)
no. 1
Précédent
Suivant
Volume 11 (2007) no. 1
Sommaire
Building Blocks of Upward Planar Digraphs
Patrick Healy
;
Karol Lynch
p. 3-44
Bar k-Visibility Graphs
Alice Dean
;
William Evans
;
Ellen Gethner
;
Joshua Laison
;
Mohammad Ali Safari
;
William Trotter
p. 45-59
The Traveling Salesman Problem for Cubic Graphs
David Eppstein
p. 61-81
Equi-partitioning of Higher-dimensional Hyper-rectangular Grid Graphs
Athula Gunawardena
;
Robert Meyer
p. 83-98
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
Donatello Conte
;
Pasquale Foggia
;
Mario Vento
p. 99-143
Fixed-Location Circular Arc Drawing of Planar Graphs
Alon Efrat
;
Cesim Erten
;
Stephen Kobourov
p. 145-164
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
Kerri Morgan
;
Graham Farr
p. 165-193
Estimating the Number of s-t Paths in a Graph
Ben Roberts
;
Dirk Kroese
p. 195-214
Simultaneous Border Segmentation of Doughnut-Shaped Objects in Medical Images
Xiaodong Wu
;
Michael Merickel
p. 215-237
Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time
Mauro Mezzini
p. 239-257
Planar Embeddings of Graphs with Specified Edge Lengths
Sergio Cabello
;
Erik Demaine
;
Günter Rote
p. 259-276
Specific Selection of FFT Amplitudes from Audio Sports and News Broadcasting for Classification Purposes
Marios Poulos
;
George Bokos
;
Nikolaos Kanellopoulos
;
Sozon Papavlasopoulos
;
Markos Avlonitis
p. 277-307
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Louigi Addario-Berry
;
Neil Olver
;
Adrian Vetta
p. 309-319