Quelle digraphs.bib Sprache: Latech

% Cite keys match the cite keys that are used in the compiled GAPDoc manual

@article{B12,
   author = {John M. Boyer},
   title = {Subgraph Homeomorphism via the Edge Addition Planarity Algorithm},
   journal = {Journal of Graph Algorithms and Applications},
   year = {2012},
   volume = {16},
   number = {2},
   pages = {381--410},
   doi = {10.7155/jgaa.00268}
}

@article{BM04,
   author = {John M. Boyer and Wendy J. Myrvold},
   title = {On the Cutting Edge: Simplified O(n) Planarity by Edge Addition},
   journal = {Journal of Graph Algorithms and Applications},
   year = {2004},
   volume = {8},
   number = {3},
   pages = {241--273},
   doi = {10.7155/jgaa.00091}
}

@inproceedings{B06,
  address = {Berlin, Heidelberg},
  author = {John M. Boyer},
  booktitle = {Graph Drawing},
  editor = {Healy, Patrick and Nikolov, Nikola S.},
  isbn = {978-3-540-31667-1},
  pages = {508--511},
  publisher = {Springer Berlin Heidelberg},
  title = {A New Method for Efficiently Generating Planar Graph Visibility Representations},
  year = {2006}}

@incollection{BM06,
  author = {John M. Boyer and Wendy J. Myrvold},
  Booktitle = {Graph Algorithms and Applications 5},
  Doi = {10.1142/9789812773289_0014},
  Month = {Jun},
  Pages = {241--273},
  Publisher = {World Scientific},
  Title = {On the Cutting Edge: Simplified O(n) Planarity by Edge Addition},
  Url = {https://doi.org/10.1142/9789812773289_0014},
  Year = {2006},
  Bdsk-Url-1 = {https://doi.org/10.1142/9789812773289_0014},
}

@article{CK86,
  Author = {Calderbank, R. and Kantor, W. M.},
  Coden = {LMSBBT},
  Doi = {10.1112/blms/18.2.97},
  Fjournal = {The Bulletin of the London Mathematical Society},
  Issn = {0024-6093},
  Journal = {Bull. London Math. Soc.},
  Mrclass = {51E20 (05B25 05C25 94B60)},
  Mrnumber = {818812 (87h:51022)},
  Mrreviewer = {J. W. P. Hirschfeld},
  Number = {2},
  Pages = {97--122},
  Title = {The geometry of two-weight codes},
  Url = {https://dx.doi.org/10.1112/blms/18.2.97},
  Volume = {18},
  Year = {1986},
  Bdsk-Url-1 = {https://dx.doi.org/10.1112/blms/18.2.97},
}

@article{Gab00,
  Author = {Harold N. Gabow},
  Doi = {https://dx.doi.org/10.1016/S0020-0190(00)00051-X},
  Issn = {0020-0190},
  Journal = {Information Processing Letters},
  Keywords = {Algorithms},
  Number = {34},
  Pages = {107 - 114},
  Title = {Path-based depth-first search for strong and biconnected
           components},
  Url = {https://www.sciencedirect.com/science/article/pii/S002001900000051X},
  Volume = {74},
  Year = {2000},
  Bdsk-Url-2 = {https://dx.doi.org/10.1016/S0020-0190(00)00051-X},
  Bdsk-Url-1 = {https://www.sciencedirect.com/science/article/pii/S002001900000051X},
}

@inproceedings{JK07,
  Author = {Tommi Junttila and Petteri Kaski},
  Booktitle = {Proceedings of the Ninth Workshop on Algorithm Engineering and
               Experiments and the Fourth Workshop on Analytic Algorithms and
               Combinatorics},
  Editor = {David Applegate and Gerth St{\o}lting Brodal and Daniel Panario and
            Robert Sedgewick},
  Optaddress = {New Orleans, LA},
  Optmonth = {January 6},
  Optpublisher = {Society for Industrial and Applied Mathematics},
  Pages = {135--149},
  Publisher = {SIAM},
  Title = {Engineering an efficient canonical labeling tool for large and
           sparse graphs},
  Year = {2007},
}

@article{LT79,
  Author = {Thomas Lengauer and Robert E. Tarjan},
  Doi = {https://doi.org/10.1145/357062.357071},
  Journal = {ACM Transactions on Programming Languages and Systems},
  Number = {1},
  Pages = {121--141},
  Title = {A Fast Algorithm for Finding Dominators in a Flowgraph},
  Url = {https://doi.org/10.1145/357062.357071},
  Volume = {1},
  Year = {1979},
  Bdsk-Url-1 = {https://www.cs.princeton.edu/courses/archive/spr03/cs423/download/dominators.pdf}
}

@article{MP14,
  Author = {Brendan D. McKay and Adolfo Piperno},
  Doi = {https://dx.doi.org/10.1016/j.jsc.2013.09.003},
  Issn = {0747-7171},
  Journal = {Journal of Symbolic Computation},
  Number = {0},
  Pages = {94 - 112},
  Title = {Practical graph isomorphism, {II}},
  Url = {https://www.sciencedirect.com/science/article/pii/S0747717113001193},
  Volume = {60},
  Year = {2014},
  Bdsk-Url-2 = {https://dx.doi.org/10.1016/j.jsc.2013.09.003},
  Bdsk-Url-1 = {https://www.sciencedirect.com/science/article/pii/S0747717113001193},
}

@article{vLS81,
  Author = {van Lint, J. H. and Schrijver, A.},
  Coden = {COMBDI},
  Doi = {10.1007/BF02579178},
  Fjournal = {Combinatorica. An International Journal of the J\'anos Bolyai
              Mathematical Society},
  Issn = {0209-9683},
  Journal = {Combinatorica},
  Mrclass = {05B25 (05C25 94B25)},
  Mrnumber = {602417 (82d:05041)},
  Mrreviewer = {Joseph A. Thas},
  Number = {1},
  Pages = {63--73},
  Title = {Construction of strongly regular graphs, two-weight codes and
           partial geometries by finite fields},
  Url = {https://dx.doi.org/10.1007/BF02579178},
  Volume = {1},
  Year = {1981},
  Bdsk-Url-1 = {https://dx.doi.org/10.1007/BF02579178},
}

% FIXME The Welsh paper is not cited in the manual!

@article{Welsh1967aa,
  Author = {Welsh, D. J. A. and Powell, M. B.},
  Doi = {10.1093/comjnl/10.1.85},
  Journal = {The Computer Journal},
  Number = {1},
  Pages = {85-86},
  Title = {An upper bound for the chromatic number of a graph and its
           application to timetabling problems},
  Url = {https://dx.doi.org/10.1093/comjnl/10.1.85},
  Volume = {10},
  Year = {1967},
  Bdsk-Url-1 = {https://dx.doi.org/10.1093/comjnl/10.1.85}
}

@article{Law1976,
    Title={A Note on the Complexity of the Chromatic Number Problem},
    Author={E. Lawler},
    Journal={Inf. Process. Lett.},
    Year={1976},
    Volume={5},
    Pages={66-67}
}

@article{Bys2002,
    Author = {Byskov, Jesper},
    Year = {2002},
    Month = {12},
    Pages = {},
    Title = {Chromatic Number in Time O(2.4023 n ) Using Maximal Independent Sets},
    Volume = {9},
    Journal = {BRICS Report Series},
    Doi = {10.7146/brics.v9i45.21760}
}

@InProceedings{US14,
    author="Uno, Takeaki and Satoh, Hiroko",
    title="An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths",
    booktitle="Discovery Science",
    year="2014",
    publisher="Springer International Publishing",
    pages="313--324",
    isbn="978-3-319-11812-3"
}

@article{Corneil1973,
    author = {Corneil, D. G. and Graham, B.},
    title = {An Algorithm for Determining the Chromatic Number of a Graph},
    journal = {SIAM Journal on Computing},
    volume = {2},
    number = {4},
    pages = {311-318},
    year = {1973},
    doi = {10.1137/0202026},
    URL = {https://doi.org/10.1137/0202026},
    eprint = {https://doi.org/10.1137/0202026}
}

@article{Wang1974,
    author= {Wang, Chung C.},
    title = {An Algorithm for the Chromatic Number of a Graph},
    year = {1974},
    issue_date = {July 1974},
    publisher = {Association for Computing Machinery},
    address = {New York, NY, USA},
    volume = {21},
    number = {3},
    issn = {0004-5411},
    url = {https://doi.org/10.1145/321832.321837},
    doi = {10.1145/321832.321837},
    abstract = {Christofides' algorithm for finding the chromatic number of a graph is improved both in speed and memory space by using a depth-first search rule to search for a shortest path in a reduced subgraph tree.},
    journal = {J. ACM},
    month = jul,
    pages = {385–391},
    numpages = {7}
}

quality95%

¤ Dauer der Verarbeitung: 0.17 Sekunden (vorverarbeitet) ¤

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.