Consequences of an algorithm for bridged graphs
- Author
- VAN BANG LE1 ; SPINRAD, Jerry2
[1] Fachbereich Informatik, Universität Rostock, Rostock 18051, Germany
[2] Deptartment of Computer Science, Vanderbilt University, Nashville, TN 37235, United States - Source
Discrete mathematics. 2004, Vol 280, Num 1-3, pp 271-274, 4 p ; ref : 10 ref
- CODEN
- DSMHA4
- ISSN
- 0012-365X
- Scientific domain
- Computer science; Mathematics
- Publisher
- Elsevier, Amsterdam
- Publication country
- Netherlands
- Document type
- Article
- Language
- English
- Keyword (fr)
- Complexité temps Mathématiques discrètes Reconnaissance Relation ordre Théorie graphe Algorithme graphe Graphe pont
- Keyword (en)
- Time complexity Discrete mathematics Recognition Ordering Graph theory Graph algorithm Bridged graph
- Keyword (es)
- Complejidad tiempo Matemáticas discretas Reconocimiento Relación orden Teoría grafo
- Classification
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02B Combinatorics. Ordered structures / 001A02B01 Combinatorics
- Discipline
- Mathematics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 15609238
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.1016/j.disc.2002.05.001 
https://dx.doi.org/10.1016/j.disc.2002.05.001
