-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcitelist.html
248 lines (246 loc) · 14.5 KB
/
citelist.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.11.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>LAL: Linear Arrangement Library: Bibliography</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<script type="text/javascript" src="clipboard.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="cookie.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">LAL: Linear Arrangement Library<span id="projectnumber"> 21.07.01</span>
</div>
<div id="projectbrief">A library focused on algorithms on linear arrangements of graphs.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.11.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
$(function() { codefold.init(0); });
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
$(function() {
initMenu('',true,false,'search.php','Search',false);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
$(function(){ initResizable(false); });
/* @license-end */
</script>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
</div><!-- top -->
<div id="doc-content">
<div><div class="header">
<div class="headertitle"><div class="title">Bibliography</div></div>
</div><!--header-->
<div class="contents">
<div class="textblock"><dl class="citelist">
<dt><a class="anchor" id="CITEREF_Aho1974a"></a>[1]</dt>
<dd><p class="startdd">A. V. Aho, J. E. Hopcroft, and J. D. Ullman. <em>The Design and Analysis of Computer Algorithms</em>. Addison-Wesley series in computer science and information processing. Addison-Wesley Publishing Company, Michigan University, 1st edition, 1974.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Alemany2020a"></a>[2]</dt>
<dd><p class="startdd">Lluís Alemany-Puig and Ramon Ferrer-i Cancho. Edge crossings in random linear arrangements. <em>Journal of Statistical Mechanics</em>, page In press, 2020.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Alemany2020b"></a>[3]</dt>
<dd><p class="startdd">Lluís Alemany-Puig and Ramon Ferrer-i Cancho. Fast calculation of the variance of edge crossings in random linear arrangements. page In prep, 2020.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Alemany2021c"></a>[4]</dt>
<dd><p class="startdd">Lluís Alemany-Puig and Ramon Ferrer-i-Cancho. <a href="To be submitted">Linear-time calculation of the expected sum of edge lengths in planar linearizations of trees</a>. <em>Arxiv</em>, 2021.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Alemany2021b"></a>[5]</dt>
<dd><p class="startdd">Lluís Alemany-Puig and Ramon Ferrer-i-Cancho. <a href="To be submitted">Linear-time calculation of the expected sum of edge lengths in projective linearizations of trees</a>. <em>Arxiv</em>, 2021.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Alemany2021a"></a>[6]</dt>
<dd><p class="startdd">Lluís Alemany-Puig, Juan Luis Esteban, and Ramon Ferrer-i-Cancho. <a href="http://arxiv.org/abs/2102.03277">Minimum projective linearizations of trees in linear time</a>. <em>Arxiv</em>, 2021.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Alonso1995a"></a>[7]</dt>
<dd><p class="startdd">L. Alonso and R. Schott. <em>Random generation of trees. Random generators in computer science</em>. Springer, 1995.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_English2019a"></a>[8]</dt>
<dd><p class="startdd">Patrick Bennett, Sean English, and Maria Talanda-Fisher. <a href="https://www.sciencedirect.com/science/article/pii/S0012365X19301268">Weighted turán problems with applications</a>. <em>Discrete Mathematics</em>, 342(8):2165–2172, 2019. </p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Beyer1980a"></a>[9]</dt>
<dd><p class="startdd">Terry Beyer and Sandra Mitchell Hedetniemi. Constant time generation of rooted trees. <em>SIAM Journal on Computing</em>, 9(4):706–712, 1980.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Chung1984a"></a>[10]</dt>
<dd><p class="startdd">F. R. K. Chung. On optimal linear arrangements of trees. <em>Computers and Mathematics with Applications</em>, 10(1):43–60, 1984. </p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Esteban2017a"></a>[11]</dt>
<dd><p class="startdd">Juan Luis Esteban and Ramon Ferrer-i Cancho. A correction on Shiloach's algorithm for minimum linear arrangements of trees. <em>Society for Industrial and Applied Mathematics</em>, 46(3):1146–1151, 2017. </p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Ferrer2018a"></a>[12]</dt>
<dd><p class="startdd">Ramon Ferrer-i Cancho, Gómez-Rodríguez C., and Juan Luis Esteban. Are crossing dependencies really scarce? <em>Physica A: Statistical Mechanics and its Applications</em>, 493:311–329, 2018.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Ferrer2014a"></a>[13]</dt>
<dd><p class="startdd">Ramon Ferrer-i Cancho. A stronger null hypothesis for crossing dependencies. <em>CoRR</em>, abs/1410.5485, 2014.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Futrell2015a"></a>[14]</dt>
<dd><p class="startdd">R. Futrell, K. Mahowald, and E. Gibson. Large-scale evidence of dependency length minimization in 37 languages. <em>Proceedings of the National Academy of Sciences</em>, 112(33):10336–10341, 2015. </p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Gildea2007a"></a>[15]</dt>
<dd><p class="startdd">Daniel Gildea and David Temperley. <a href="https://www.aclweb.org/anthology/P07-1024">Optimizing grammars for minimum dependency length</a>. In <em>Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics</em>, pages 184–191, Prague, Czech Republic, June 2007. Association for Computational Linguistics.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_GMP_library"></a>[16]</dt>
<dd><p class="startdd">The gnu multiple precision arithmetic library. <a href="https://gmplib.org/">https://gmplib.org/</a>. Accessed: 2020-03-24.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Gomez2011a"></a>[17]</dt>
<dd><p class="startdd">Carlos Gómez-Rodríguez, John Carroll, and David Weir. Dependency parsing schemata and mildly non-projective dependency parsing. <em>Computational Linguistics</em>, 37:541–586, 2011. </p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Harary1973a"></a>[18]</dt>
<dd><p class="startdd">Frank Harary and Allen J. Schwenk. The number of caterpillars. <em>Discrete Mathematics</em>, 6:359–365, 1973. </p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Harary1969a"></a>[19]</dt>
<dd><p class="startdd">Frank Harary. <em>Graph Theory</em>. CRC Press, Boca Raton, FL, USA, 2nd edition, 1969.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Hochberg2003a"></a>[20]</dt>
<dd><p class="startdd">Robert A. Hochberg and Matthias F. Stallmann. <a href="http://www.sciencedirect.com/science/article/pii/S0020019003002618">Optimal one-page tree embeddings in linear time</a>. <em>Information Processing Letters</em>, 87(2):59–66, 2003. </p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Ferrer2019a"></a>[21]</dt>
<dd><p class="startdd">Ramon Ferrer i Cancho. The sum of edge lengths in random linear arrangements. <em>Journal of Statistical Mechanics: Theory and Experiment</em>, 2019:053401, 05 2019. </p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Iordanskii1987a"></a>[22]</dt>
<dd><p class="startdd">M. A. Iordanskii. Minimal numberings of the vertices of trees — approximate approach. In Lothar Budach, Rais Gatic Bukharajev, and Oleg Borisovic Lupanov, editors, <em>Fundamentals of Computation Theory</em>, pages 214–217, Berlin, Heidelberg, 1987. Springer Berlin Heidelberg.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Jing2015a"></a>[23]</dt>
<dd><p class="startdd">Yingqi Jing and Haitao Liu. Mean Hierarchical Distance: Augmenting Mean Dependency Distance. <em>Proceedings of the Third International Conference on Dependency Linguistics (Depling 2015)</em>, (Depling):161–170, 2015.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Kahane2017a"></a>[24]</dt>
<dd><p class="startdd">Sylvain Kahane, Chunxiao Yan, and Marie-Amélie Botalla. <a href="https://hal.archives-ouvertes.fr/hal-01675325">What are the limitations on the flux of syntactic dependencies? evidence from ud treebanks</a>. pages 73–82, 9 2017.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Liu2010a"></a>[25]</dt>
<dd><p class="startdd">H. Liu. Dependency direction as a means of word-order typology: a method based on dependency treebanks. <em>Lingua</em>, 120(6):1567–1578, 2010.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_GiacXcas_Manual"></a>[26]</dt>
<dd><p class="startdd">Luka Marohnić. Graph theory package for giac/xcas - reference manual. <a href=" https://usermanual.wiki/Document/graphtheoryusermanual.346702481/view">https://usermanual.wiki/Document/graphtheoryusermanual.346702481/view</a>. Accessed: 2020-01-13.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Nijenhuis1978a"></a>[27]</dt>
<dd><p class="startdd">Albert Nijenhuis and Herbert S. Wilf. <em>Combinatorial Algorithms: For Computers and Hard Calculators</em>. Academic Press, Inc., Orlando, FL, USA, 2nd edition, 1978.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Otter1948a"></a>[28]</dt>
<dd><p class="startdd">Richard Otter. Annals of Mathematics The Number of Trees. 49(3):583–599, 1948. </p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Pruefer1918a"></a>[29]</dt>
<dd><p class="startdd">H. Prüfer. Neuer Beweis eines Satzes über Permutationen. <em>Arch. Math. Phys</em>, 27:742–744, 1918.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Pitler2013a"></a>[30]</dt>
<dd><p class="startdd">Giorgio Satta, Emily Pitler, Sampath Kannan, and Mitchell Marcus. <a href="https://www.mitpressjournals.org/doi/pdfplus/10.1162/tacl_a_00206">Finding optimal 1-endpoint-crossing trees</a>. pages 13–24, 2013.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Shiloach1979a"></a>[31]</dt>
<dd><p class="startdd">Yossi Shiloach. A minimum linear arrangement algorithm for undirected trees. <em>Society for Industrial and Applied Mathematics</em>, 8(1):15–32, 1979. </p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_OEIS_A000055"></a>[32]</dt>
<dd><p class="startdd">N. J. A. Sloane. The on-line encyclopedia of integer sequences - a000055 - number of trees with n unlabeled nodes. <a href="https://oeis.org/A000055">https://oeis.org/A000055</a>. Accessed: 2019-12-28.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_OEIS_A000081"></a>[33]</dt>
<dd><p class="startdd">N. J. A. Sloane. The on-line encyclopedia of integer sequences - a000081 - number of unlabeled rooted trees with n nodes (or connected functions with a fixed point). <a href="https://oeis.org/A000081">https://oeis.org/A000081</a>. Accessed: 2019-03-31.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Wilf1981a"></a>[34]</dt>
<dd><p class="startdd">H. S. Wilf. The uniform selection of free trees. <em>Journal of Algorithms</em>, 2:204–207, 1981.</p>
<p class="enddd"></p>
</dd>
<dt><a class="anchor" id="CITEREF_Wright1986a"></a>[35]</dt>
<dd><p class="startdd">Robert Alan Wright, Bruce Richmond, Andrew Odlyzko, and Brendan D McKay. Constant time generation of free trees. <em>SIAM Journal on Computing</em>, 15:540–548, 05 1986. </p>
<p class="enddd"></p>
</dd>
</dl>
</div></div><!-- contents -->
</div><!-- PageDoc -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.11.0
</small></address>
</div><!-- doc-content -->
</body>
</html>