Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20415330

A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem

Author
GUOHUI YAO1 ; DAMING ZHU1 ; HENGWU LI2 ; SHAOHAN MA1
[1] School of Computer Science and Technology, Shandong University, Jinan 250061, China
[2] Department of Computer Science and Technology, Shandong Economic University, Jinan 250014, China
Source

Discrete mathematics. 2008, Vol 308, Num 17, pp 3951-3959, 9 p ; ref : 35 ref

CODEN
DSMHA4
ISSN
0012-365X
Scientific domain
Computer science; Mathematics
Publisher
Elsevier, Amsterdam
Publication country
Netherlands
Document type
Article
Language
English
Author keyword
Directed acyclic graph Minimum time broadcast Spanning tree algorithm
Keyword (fr)
Application Arbre graphe Arbre maximal Arête graphe Degré graphe Digraphe Graphe acyclique Graphe orienté Maximum Optimum Temps minimal Temps polynomial Vertex 05C05 05C20 68Wxx Algorithme polynomial
Keyword (en)
Application Tree(graph) Spanning tree Edge(graph) Graph degree Digraph Acyclic graph Directed graph Maximum Optimum Minimum time Polynomial time Vertex
Keyword (es)
Aplicación Arbol grafo Arbol máximo Arista gráfico Grado grafo Digrafo Grafo acíclico Grafo orientado Máximo Optimo Tiempo mínimo Tiempo polinomial Vértice
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02B Combinatorics. Ordered structures / 001A02B01 Combinatorics / 001A02B01C Graph theory

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

Discipline
Computer science : theoretical automation and systems Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
20415330

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

Searching the Web