Quellcodebibliothek Statistik Leitseite products/Sources/formale Sprachen/GAP/pkg/modules/gap/   (Algebra von RWTH Aachen Version 4.15.1©)  Datei vom 22.11.2024 mit Größe 812 B image not shown  

Quelle  chapBib_mj.html   Sprache: HTML

 
 products/Sources/formale Sprachen/GAP/pkg/digraphs/doc/chapBib_mj.html


<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
         "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<script type="text/javascript"
  src="https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
</script>
<title>GAP (Digraphs) - References</title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<meta name="generator" content="GAPDoc2HTML" />
<link rel="stylesheet" type="text/css" href="manual.css" />
<script src="manual.js" type="text/javascript"></script>
<script type="text/javascript">overwriteStyle();</script>
</head>
<body class="chapBib"  onload="jscontent()">


<div class="chlinktop"><span class="chlink1">Goto Chapter: </span><a href="chap0_mj.html">Top</a>  <a href="chap1_mj.html">1</a>  <a href="chap2_mj.html">2</a>  <a href="chap3_mj.html">3</a>  <a href="chap4_mj.html">4</a>  <a href="chap5_mj.html">5</a>  <a href="chap6_mj.html">6</a>  <a href="chap7_mj.html">7</a>  <a href="chap8_mj.html">8</a>  <a href="chap9_mj.html">9</a>  <a href="chapA_mj.html">A</a>  <a href="chapB_mj.html">B</a>  <a href="chapBib_mj.html">Bib</a>  <a href="chapInd_mj.html">Ind</a>  </div>

<div class="chlinkprevnexttop"> <a href="chap0_mj.html">[Top of Book]</a>   <a href="chap0_mj.html#contents">[Contents]</a>    <a href="chapB_mj.html">[Previous Chapter]</a>    <a href="chapInd_mj.html">[Next Chapter]</a>   </div>

<p id="mathjaxlink" class="pcenter"><a href="chapBib.html">[MathJax off]</a></p>
<p><a id="X7A6F98FD85F02BFE" name="X7A6F98FD85F02BFE"></a></p>

<h3>References</h3>


<p><a id="biBBM04" name="biBBM04"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>BM04</span>]   <b class='BibAuthor'>Boyer, J. M. and Myrvold, W. J.</b>,
 <i class='BibTitle'>On the Cutting Edge: Simplified O(n) Planarity by Edge
      Addition</i>,
 <span class='BibJournal'>Journal of Graph Algorithms and Applications</span>,
 <em class='BibVolume'>8</em> (<span class='BibNumber'>3</span>)
 (<span class='BibYear'>2004</span>),
 <span class='BibPages'>241--273</span>.
</p>


<p><a id="biBBM06" name="biBBM06"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>BM06</span>]   <b class='BibAuthor'>Boyer, J. M. and Myrvold, W. J.</b>,
<a href="https://doi.org/10.1142/9789812773289_0014"><i class='BibTitle'>On the Cutting Edge: Simplified O(n) Planarity by Edge
      Addition</i></a>,
  in  <i class='BibBooktitle'>Graph Algorithms and Applications 5</i>,
 <span class='BibPublisher'>World Scientific</span>
 (<span class='BibYear'>2006</span>),
 <span class='BibPages'>241--273</span>.
</p>


<p><a id="biBB06" name="biBB06"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Boy06</span>]   <b class='BibAuthor'>Boyer, J. M.</b> (<span class='BibEditor'>Healy, P. and Nikolov, N. S.</span>, Eds.),
 <i class='BibTitle'>A New Method for Efficiently Generating Planar Graph Visibility
      Representations</i>,
  in  <i class='BibBooktitle'>Graph Drawing</i>,
 <span class='BibPublisher'>Springer Berlin Heidelberg</span>,
 <span class='BibAddress'>Berlin, Heidelberg</span>
 (<span class='BibYear'>2006</span>),
 <span class='BibPages'>508--511</span>.
</p>


<p><a id="biBB12" name="biBB12"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Boy12</span>]   <b class='BibAuthor'>Boyer, J. M.</b>,
 <i class='BibTitle'>Subgraph Homeomorphism via the Edge Addition Planarity
      Algorithm</i>,
 <span class='BibJournal'>Journal of Graph Algorithms and Applications</span>,
 <em class='BibVolume'>16</em> (<span class='BibNumber'>2</span>)
 (<span class='BibYear'>2012</span>),
 <span class='BibPages'>381--410</span>.
</p>


<p><a id="biBBys2002" name="biBBys2002"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Bys02</span>]   <b class='BibAuthor'>Byskov, J.</b>,
 <i class='BibTitle'>Chromatic Number in Time O(2.4023 n ) Using Maximal Independent
      Sets</i>,
 <span class='BibJournal'>BRICS Report Series</span>,
 <em class='BibVolume'>9</em>
 (<span class='BibYear'>2002</span>),
 <span class='BibPages'></span>.
</p>


<p><a id="biBCorneil1973" name="biBCorneil1973"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>CG73</span>]   <b class='BibAuthor'>Corneil, D. G. and Graham, B.</b>,
<a href="https://doi.org/10.1137/0202026"><i class='BibTitle'>An Algorithm for Determining the Chromatic Number of a Graph</i></a>,
 <span class='BibJournal'>SIAM Journal on Computing</span>,
 <em class='BibVolume'>2</em> (<span class='BibNumber'>4</span>)
 (<span class='BibYear'>1973</span>),
 <span class='BibPages'>311-318</span>.
</p>


<p><a id="biBCK86" name="biBCK86"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=818812">CK86</a></span>]   <b class='BibAuthor'>Calderbank, R. and Kantor, W. M.</b>,
<a href="https://dx.doi.org/10.1112/blms/18.2.97"><i class='BibTitle'>The geometry of two-weight codes</i></a>,
 <span class='BibJournal'>Bull. London Math. Soc.</span>,
 <em class='BibVolume'>18</em> (<span class='BibNumber'>2</span>)
 (<span class='BibYear'>1986</span>),
 <span class='BibPages'>97--122</span>.
</p>


<p><a id="biBGab00" name="biBGab00"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Gab00</span>]   <b class='BibAuthor'>Gabow, H. N.</b>,
<a href="https://www.sciencedirect.com/science/article/pii/S002001900000051X"><i class='BibTitle'>Path-based depth-first search for strong and biconnected
           components</i></a>,
 <span class='BibJournal'>Information Processing Letters</span>,
 <em class='BibVolume'>74</em> (<span class='BibNumber'>34</span>)
 (<span class='BibYear'>2000</span>),
 <span class='BibPages'>107 - 114</span>.
</p>


<p><a id="biBJK07" name="biBJK07"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>JK07</span>]   <b class='BibAuthor'>Junttila, T. and Kaski, P.</b> (<span class='BibEditor'>Applegate, D., Brodal, G. S., Panario, D. and Sedgewick, R.</span>, Eds.),
 <i class='BibTitle'>Engineering an efficient canonical labeling tool for large and
           sparse graphs</i>,
  in  <i class='BibBooktitle'>Proceedings of the Ninth Workshop on Algorithm Engineering and
  Experiments and the Fourth Workshop on Analytic Algorithms and
               Combinatorics</i>,
 <span class='BibPublisher'>SIAM</span>
 (<span class='BibYear'>2007</span>),
 <span class='BibPages'>135--149</span>.
</p>


<p><a id="biBLaw1976" name="biBLaw1976"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Law76</span>]   <b class='BibAuthor'>Lawler, E.</b>,
 <i class='BibTitle'>A Note on the Complexity of the Chromatic Number Problem</i>,
 <span class='BibJournal'>Inf. Process. Lett.</span>,
 <em class='BibVolume'>5</em>
 (<span class='BibYear'>1976</span>),
 <span class='BibPages'>66-67</span>.
</p>


<p><a id="biBLT79" name="biBLT79"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>LT79</span>]   <b class='BibAuthor'>Lengauer, T. and Tarjan, R. E.</b>,
<a href="https://doi.org/10.1145/357062.357071"><i class='BibTitle'>A Fast Algorithm for Finding Dominators in a Flowgraph</i></a>,
 <span class='BibJournal'>ACM Transactions on Programming Languages and Systems</span>,
 <em class='BibVolume'>1</em> (<span class='BibNumber'>1</span>)
 (<span class='BibYear'>1979</span>),
 <span class='BibPages'>121--141</span>.
</p>


<p><a id="biBMP14" name="biBMP14"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>MP14</span>]   <b class='BibAuthor'>McKay, B. D. and Piperno, A.</b>,
<a href="https://www.sciencedirect.com/science/article/pii/S0747717113001193"><i class='BibTitle'>Practical graph isomorphism, II</i></a>,
 <span class='BibJournal'>Journal of Symbolic Computation</span>,
 <em class='BibVolume'>60</em> (<span class='BibNumber'>0</span>)
 (<span class='BibYear'>2014</span>),
 <span class='BibPages'>94 - 112</span>.
</p>


<p><a id="biBUS14" name="biBUS14"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>US14</span>]   <b class='BibAuthor'>Uno, T. and Satoh, H.</b>,
 <i class='BibTitle'>An Efficient Algorithm for Enumerating Chordless Cycles and Chordless
      Paths</i>,
  in  <i class='BibBooktitle'>Discovery Science</i>,
 <span class='BibPublisher'>Springer International Publishing</span>
 (<span class='BibYear'>2014</span>),
 <span class='BibPages'>313--324</span>.
</p>


<p><a id="biBvLS81" name="biBvLS81"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=602417">vLS81</a></span>]   <b class='BibAuthor'>van Lint, J. H. and Schrijver, A.</b>,
<a href="https://dx.doi.org/10.1007/BF02579178"><i class='BibTitle'>Construction of strongly regular graphs, two-weight codes and
           partial geometries by finite fields</i></a>,
 <span class='BibJournal'>Combinatorica</span>,
 <em class='BibVolume'>1</em> (<span class='BibNumber'>1</span>)
 (<span class='BibYear'>1981</span>),
 <span class='BibPages'>63--73</span>.
</p>


<p><a id="biBWang1974" name="biBWang1974"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Wan74</span>]   <b class='BibAuthor'>Wang, C. C.</b>,
<a href="https://doi.org/10.1145/321832.321837"><i class='BibTitle'>An Algorithm for the Chromatic Number of a Graph</i></a>,
 <span class='BibJournal'>J. ACM</span>,
 <span class='BibPublisher'>Association for Computing Machinery</span>,
 <em class='BibVolume'>21</em> (<span class='BibNumber'>3</span>),
 <span class='BibAddress'>New York, NY, USA</span>
 (<span class='BibYear'>1974</span>),
 <span class='BibPages'>385–391</span>.
</p>

<p> </p>


<div class="chlinkprevnextbot"> <a href="chap0_mj.html">[Top of Book]</a>   <a href="chap0_mj.html#contents">[Contents]</a>    <a href="chapB_mj.html">[Previous Chapter]</a>    <a href="chapInd_mj.html">[Next Chapter]</a>   </div>


<div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0_mj.html">Top</a>  <a href="chap1_mj.html">1</a>  <a href="chap2_mj.html">2</a>  <a href="chap3_mj.html">3</a>  <a href="chap4_mj.html">4</a>  <a href="chap5_mj.html">5</a>  <a href="chap6_mj.html">6</a>  <a href="chap7_mj.html">7</a>  <a href="chap8_mj.html">8</a>  <a href="chap9_mj.html">9</a>  <a href="chapA_mj.html">A</a>  <a href="chapB_mj.html">B</a>  <a href="chapBib_mj.html">Bib</a>  <a href="chapInd_mj.html">Ind</a>  </div>

<hr />
<p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
</body>
</html>

99%


¤ Dauer der Verarbeitung: 0.14 Sekunden  (vorverarbeitet)  ¤

*© Formatika GbR, Deutschland




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.