Representing trees of higher degree
- Author
- BENOIT, D1 2 ; DEMAINE, E. D2 ; MUNRO, J. I2 ; RAMAN, V3
[1] InfoInteractive Inc., Suite 604, 1550 Bedford Hwy., Bedford. N.S. B4A 1E6, Canada
[2] Dept. of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
[3] Institute of Mathematical Sciences, Chennai, 600 113, India - Conference title
- Algorithms and data structures (Vancouver, 11-14 August 1999)
- Conference name
- WADS '99 : workshop on algorithms and data structures (6 ; Vancouver 1999-08-11)
- Author (monograph)
- Dehne, Frank (Editor); Gupta, Arvind (Editor); Sack, Jörg-Rüdiger (Editor); Tamassia, Roberto (Editor)
- Source
Lecture notes in computer science. 1999, pp 169-180 ; ref : 15 ref
- ISSN
- 0302-9743
- ISBN
- 3-540-66279-0
- Scientific domain
- Computer science
- Publisher
- Springer, Berlin
- Publication country
- Germany
- Document type
- Conference Paper
- Language
- English
- Keyword (fr)
- Arbre graphe Construction graphe Géométrie combinatoire Informatique théorique Recherche information Structure donnée
- Keyword (en)
- Tree(graph) Graph construction Combinatorial geometry Computer theory Information retrieval Data structure
- Keyword (es)
- Arbol grafo Construcción grafo Geometría combinatoria Informática teórica Recuperación información Estructura datos
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A06 Information retrieval. Graph
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 1825041
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1007/3-540-48447-7_18 
https://dx.doi.org/10.1007/3-540-48447-7_18
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:24:\"10.1007\/3-540-48447-7_18\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:35:\"Representing trees of higher degree\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Lecture notes in computer science\";s:9:\"\u0000*\u0000stitle\";s:23:\"Lect. notes comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:3:\"169\";s:8:\"\u0000*\u0000epage\";s:3:\"180\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0302-9743\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"BENOIT\";s:10:\"\u0000*\u0000aufirst\";s:1:\"D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:13:\"DEMAINE, E. D\";i:1;s:11:\"MUNRO, J. I\";i:2;s:8:\"RAMAN, V\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"3-540-66279-0\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:61:\"Algorithms and data structures (Vancouver, 11-14 August 1999)\";s:8:\"\u0000*\u0000title\";s:35:\"Representing trees of higher degree\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:24:\"10.1007\/3-540-48447-7_18\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:35:\"Representing trees of higher degree\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Lecture notes in computer science\";s:9:\"\u0000*\u0000stitle\";s:23:\"Lect. notes comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:3:\"169\";s:8:\"\u0000*\u0000epage\";s:3:\"180\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0302-9743\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"BENOIT\";s:10:\"\u0000*\u0000aufirst\";s:1:\"D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:13:\"DEMAINE, E. D\";i:1;s:11:\"MUNRO, J. I\";i:2;s:8:\"RAMAN, V\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"3-540-66279-0\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:61:\"Algorithms and data structures (Vancouver, 11-14 August 1999)\";s:8:\"\u0000*\u0000title\";s:35:\"Representing trees of higher degree\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:24:\"10.1007\/3-540-48447-7_18\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:24:\"10.1007\/3-540-48447-7_18\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:35:\"Representing trees of higher degree\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Lecture notes in computer science\";s:9:\"\u0000*\u0000stitle\";s:23:\"Lect. notes comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:3:\"169\";s:8:\"\u0000*\u0000epage\";s:3:\"180\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0302-9743\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"BENOIT\";s:10:\"\u0000*\u0000aufirst\";s:1:\"D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:13:\"DEMAINE, E. D\";i:1;s:11:\"MUNRO, J. I\";i:2;s:8:\"RAMAN, V\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"3-540-66279-0\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:61:\"Algorithms and data structures (Vancouver, 11-14 August 1999)\";s:8:\"\u0000*\u0000title\";s:35:\"Representing trees of higher degree\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:24:\"10.1007\/3-540-48447-7_18\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:35:\"Representing trees of higher degree\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Lecture notes in computer science\";s:9:\"\u0000*\u0000stitle\";s:23:\"Lect. notes comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:3:\"169\";s:8:\"\u0000*\u0000epage\";s:3:\"180\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0302-9743\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"BENOIT\";s:10:\"\u0000*\u0000aufirst\";s:1:\"D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:13:\"DEMAINE, E. D\";i:1;s:11:\"MUNRO, J. I\";i:2;s:8:\"RAMAN, V\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"3-540-66279-0\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:61:\"Algorithms and data structures (Vancouver, 11-14 August 1999)\";s:8:\"\u0000*\u0000title\";s:35:\"Representing trees of higher degree\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:24:\"10.1007\/3-540-48447-7_18\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:35:\"Representing trees of higher degree\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Lecture notes in computer science\";s:9:\"\u0000*\u0000stitle\";s:23:\"Lect. notes comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:3:\"169\";s:8:\"\u0000*\u0000epage\";s:3:\"180\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0302-9743\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:6:\"BENOIT\";s:10:\"\u0000*\u0000aufirst\";s:1:\"D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:13:\"DEMAINE, E. D\";i:1;s:11:\"MUNRO, J. I\";i:2;s:8:\"RAMAN, V\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"3-540-66279-0\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:61:\"Algorithms and data structures (Vancouver, 11-14 August 1999)\";s:8:\"\u0000*\u0000title\";s:35:\"Representing trees of higher degree\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
