GAP (Digraphs) - References

Goto Chapter: Top 1 2 3 4 5 6 7 8 9 A Bib Ind
[Top of Book] [Contents] [Previous Chapter] [Next Chapter]

[MathJax off]

### References

[BM04] Boyer, J. M. and Myrvold, W. J., On the Cutting Edge: Simplified O(n) Planarity by Edge Addition, Journal of Graph Algorithms and Applications, 8 (3) (2004), 241--273.

[BM06] Boyer, J. M. and Myrvold, W. J., On the Cutting Edge: Simplified O(n) Planarity by Edge Addition, in Graph Algorithms and Applications 5, {WORLD} {SCIENTIFIC} (2006), 241--273.

[Boy06] Boyer, J. M. (Healy, P. and Nikolov, N. S., Eds.), A New Method for Efficiently Generating Planar Graph Visibility Representations, in Graph Drawing, Springer Berlin Heidelberg, Berlin, Heidelberg (2006), 508--511.

[Boy12] Boyer, J. M., Subgraph Homeomorphism via the Edge Addition Planarity Algorithm, Journal of Graph Algorithms and Applications, 16 (2) (2012), 381--410.

[Bys02] Byskov, J., Chromatic Number in Time O(2.4023 n ) Using Maximal Independent Sets, BRICS Report Series, 9 (2002), .

[CK86] Calderbank, R. and Kantor, W. M., The geometry of two-weight codes, Bull. London Math. Soc., 18 (2) (1986), 97--122.

[Gab00] Gabow, H. N., Path-based depth-first search for strong and biconnected components, Information Processing Letters, 74 (34) (2000), 107 - 114.

[JK07] Junttila, T. and Kaski, P. (Applegate, D., Brodal, G. S., Panario, D. and Sedgewick, R., Eds.), Engineering an efficient canonical labeling tool for large and sparse graphs, in Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics, SIAM (2007), 135--149.

[Law76] Lawler, E., A Note on the Complexity of the Chromatic Number Problem, Inf. Process. Lett., 5 (1976), 66-67.

[LT79] Lengauer, T. and Tarjan, R. E., A Fast Algorithm for Finding Dominators in a Flowgraph, ACM Transactions on Programming Languages and Systems, 1 (1) (1979), 121--141.

[MP14] McKay, B. D. and Piperno, A., Practical graph isomorphism, II, Journal of Symbolic Computation, 60 (0) (2014), 94 - 112.

[US14] Uno, T. and Satoh, H., An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths, in Discovery Science, Springer International Publishing (2014), 313--324.

[vLS81] van Lint, J. H. and Schrijver, A., Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields, Combinatorica, 1 (1) (1981), 63--73.

[Top of Book] [Contents] [Previous Chapter] [Next Chapter]
Goto Chapter: Top 1 2 3 4 5 6 7 8 9 A Bib Ind

generated by GAPDoc2HTML