10.1007/978-3-642-38233-8_25Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)7878 LNCS300-31
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
10.1007/978-3-642-27654-5_10Lecture Notes in Computer Science (including subseries Lecture Notes in ...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...
SIGLEAvailable from TIB Hannover: RN 4052(91696-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
10.1007/11596219_2Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial...
Available from British Library Document Supply Centre- DSC:DXN062089 / BLDSC - British Library Docum...
10.1007/978-3-642-00887-0_5Lecture Notes in Computer Science (including subseries Lecture Notes in A...
Lectures: T.H. Brylawski: The Tutte polynomial.- D.J.A. Welsh: Matroids and combinatorial optimisati...
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
AbstractWe show that the maximum matroid–greedoid partition problem is NP-hard to approximate to wit...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
10.1007/978-3-642-27654-5_10Lecture Notes in Computer Science (including subseries Lecture Notes in ...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...
SIGLEAvailable from TIB Hannover: RN 4052(91696-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
10.1007/11596219_2Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial...
Available from British Library Document Supply Centre- DSC:DXN062089 / BLDSC - British Library Docum...
10.1007/978-3-642-00887-0_5Lecture Notes in Computer Science (including subseries Lecture Notes in A...
Lectures: T.H. Brylawski: The Tutte polynomial.- D.J.A. Welsh: Matroids and combinatorial optimisati...
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
AbstractWe show that the maximum matroid–greedoid partition problem is NP-hard to approximate to wit...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
DOI
Add to ORKG