Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

COMPLEXITY OF DECOMPOSING GRAPHS INTO FACTORS WITH GIVEN DIAMETERS OF RADII

Author
PLESNIK J
UNIV. KOMENSKEHO/BRATISLAVA 84215/CSK
Source
MATH. SLOV.; ISSN 0139-9918; CSK; DA. 1982; VOL. 32; NO 4; PP. 379-387; BIBL. 32 REF.
Document type
Article
Language
English
Keyword (fr)
THEORIE GRAPHE GRAPHE BIPARTI GRAPHE ORIENTE DECOMPOSITION GRAPHE COMPLEXITE CALCUL PROBLEME NP-DUR MATHEMATIQUES APPLIQUEES
Keyword (en)
GRAPH THEORY BIPARTITE GRAPH DIRECTED GRAPH APPLIED MATHEMATICS
Keyword (es)
MATEMATICAS APPLICADAS
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
PASCAL83X0000030

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

Searching the Web