• Tutte polynomials computable i...

Treffer: Tutte polynomials computable in polynomial time

Title:
Tutte polynomials computable in polynomial time
Authors:
OXLEY, J. G, WELSH, D. J. A
Source:
Algebraic graph theory a volume dedicated to Gert SadibussiDiscrete mathematics. 109(1-3):185-192
Publisher Information:
Amsterdam: Elsevier, 1992.
Publication Year:
1992
Physical Description:
print, 17 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Plans d'expériences et configurations, Designs and configurations, Complexité calcul, Computing complexity, Complejidad cálculo, Matroïde, Matroid, Matroide, Temps polynomial, Polynomial time, Tiempo polinomial, Polynome Tutte
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Louisiana state univ., dep. mathematics, Baton Rouge LA 70803, United States
ISSN:
0012-365X
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=4759710
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
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
Notes:
Mathematics
Accession Number:
edscal.4759710
Database:
PASCAL Archive

Weitere Informationen

We show that for any accessible class of matroids of bounded width, the Tutte polynomial is computable in polynomial time.