Find link

language:

Find link is a tool written by Edward Betts.

searching for Journal of Graph Algorithms and Applications 7 found (47 total)

alternate case: journal of Graph Algorithms and Applications

Defective coloring (2,169 words) [view diff] exact match in snippet view article find links to article

Symvonis, Antonios (2017). "VertexColoring with Defects". Journal of Graph Algorithms and Applications. 21 (3): 313–340. doi:10.7155/jgaa.00418. Cowen, L. J

Bend minimization (733 words) [view diff] exact match in snippet view article find links to article

Karrenbauer, Andreas (2012), "Accelerated bend minimization", Journal of Graph Algorithms and Applications, 16 (3): 635–650, doi:10.7155/jgaa.00265, MR 2983428

PGF/TikZ (1,249 words) [view diff] exact match in snippet view article find links to article

2019-06-17. Tantau, Till (2013). "Graph Drawing in TikZ". Journal of Graph Algorithms and Applications. 17 (4): 495–513. doi:10.7155/jgaa.00301. See also the

Baker's technique (875 words) [view diff] exact match in snippet view article find links to article

isomorphism in planar graphs and related problems", Journal of Graph Algorithms and Applications, 3 (3): 1–27, doi:10.7155/jgaa.00014, MR 1750082, S2CID 2303110

Hanani–Tutte theorem (953 words) [view diff] exact match in snippet view article find links to article

of planarity: Hanani–Tutte and planarity variants", Journal of Graph Algorithms and Applications, 17 (4): 367–440, doi:10.7155/jgaa.00298, MR 3094190

Louvain method (2,797 words) [view diff] exact match in snippet view article find links to article

Communities in Large Networks Using Random Walks" (PDF). Journal of Graph Algorithms and Applications. 10 (2): 191–218. arXiv:cond-mat/0412368. doi:10.7155/jgaa

Edge coloring (8,472 words) [view diff] exact match in snippet view article find links to article

Bendless Three-Dimensional Orthogonal Graph Drawing", Journal of Graph Algorithms and Applications, 17 (1): 35–55, arXiv:0709.4087, doi:10.7155/jgaa.00283