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 23 (2019)
no. 2
Précédent
Suivant
Volume 23 (2019) no. 2
Sommaire
How Bad is the Freedom to Flood-It?
Rémy Belmonte
;
Mehdi Khosravian Ghadikolaei
;
Masashi Kiyomi
;
Michael Lampis
;
Yota Otachi
p. 111-134
An effective crossing minimisation heuristic based on star insertion
Kieran Clancy
;
Michael Haythorpe
;
Alex Newcombe
p. 135-166
Finding a Maximum-Weight Convex Set in a Chordal Graph
Jean Cardinal
;
Jean-Paul Doignon
;
Keno Merckx
p. 167-190
Time Windowed Data Structures for Graphs
Farah Chanchary
;
Anil Maheshwari
p. 191-226
Short certificates for chromatic equivalence
Zoe Bukovac
;
Graham Farr
;
Kerri Morgan
p. 227-269
Covering a Graph with Clubs
Riccardo Dondi
;
Giancarlo Mauri
;
Florian Sikora
;
Italo Zoppis
p. 271-292
Constructing Hard Examples for Graph Isomorphism
Anuj Dawar
;
Kashif Khan
p. 293-316
Computation in Causal Graphs
Juli Atherton
;
Derek Ruths
;
Adrian Vetta
p. 317-344
Construction and Local Routing for Angle-Monotone Graphs
Anna Lubiw
;
Debajyoti Mondal
p. 345-369
Drawing Graphs on Few Circles and Few Spheres
Myroslav Kryven
;
Alexander Ravsky
;
Alexander Wolff
p. 371-391
Fast approximation of eccentricities and distances in hyperbolic graphs
Victor Chepoi
;
Feodor Dragan
;
Michel Habib
;
Yann Vaxès
;
Hend Alrasheed
p. 393-433
COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets
Kazuya Haraguchi
;
Yusuke Momoi
;
Aleksandar Shurbevski
;
Hiroshi Nagamochi
p. 434-458