Pascal and Francis Bibliographic Databases

Help

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

Export

Selection :

Polynomial cases of graph decomposition : A complete solution of Holyer's problem

Author
BRYS, Krzysztof1 ; LONC, Zbigniew1
[1] Faculty of Mathematics and Information Science, Warsaw University of Technology, pi. Polilechniki 1, 00-661 Warsaw, Poland
Source

Discrete mathematics. 2009, Vol 309, Num 6, pp 1294-1326, 33 p ; ref : 18 ref

CODEN
DSMHA4
ISSN
0012-365X
Scientific domain
Computer science; Mathematics
Publisher
Elsevier, Kidlington
Publication country
United Kingdom
Document type
Article
Language
English
Author keyword
Computational complexity Edge decompositions of graphs Holyer problem
Keyword (fr)
Arête graphe Complexité calcul Décomposition graphe Graphe complet Graphe isomorphe Polynôme Temps polynomial 68R10 Ensemble contour Partition ensemble Problème décision
Keyword (en)
Edge(graph) Computational complexity Graph decomposition Complete graph Isomorphic graph Polynomial Polynomial time Edge set
Keyword (es)
Arista gráfico Complejidad computación Descomposición grafo Grafo completo Grafo isomorfo Polinomio Tiempo polinomial
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

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
21337968

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