A polynomial time algorithm for strong edge coloring of partial k-trees

Authors:
Mohammad R. Salavatipour
Affiliations:
Department of Computer Science, University of Toronto, 10 King's College Rd., Toronto, ON, Canada M5S 3G4
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 11
Cited 5

Graph minors. V. Excluding a planar graph

Journal of Combinatorial Theory Series B
Graph minors. IV. Tree-width and well-quasi-ordering

Journal of Combinatorial Theory Series B
Induced matchings in bipartite graphs

Discrete Mathematics - In memory of Tory Parsons
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees

Journal of Algorithms
Easy problems for tree-decomposable graphs

Journal of Algorithms
Irredundancy in circular arc graphs

Discrete Applied Mathematics
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Edge-coloring partial k-trees

Journal of Algorithms
Parallel Algorithms with Optimal Speedup for Bounded Treewidth

SIAM Journal on Computing
New results on induced matchings

Discrete Applied Mathematics
On the computational complexity of strong edge coloring

Discrete Applied Mathematics

Algorithms for finding distance-edge-colorings of graphs

Journal of Discrete Algorithms
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Algorithms for finding distance-edge-colorings of graphs

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Generalizing the induced matching by edge capacity constraints

Discrete Optimization
Strong edge-colouring and induced matchings

Information Processing Letters

Quantified Score

Hi-index	0.04

Visualization

Abstract

The Pfaffian of an oriented graph is closely linked to perfect matching. It is also naturally related to the determinant of an appropriately defined matrix. This relation between Pfaffian and determinant is usually exploited to give a fast algorithm ...