π
π
The Cartographer
Classifying k-Edge Colouring for H-free Graphs
October 10, 2018 Β· Declared Dead Β· π Information Processing Letters
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Esther Galby, Paloma T. Lima, Daniel Paulusma, Bernard Ries
arXiv ID
1810.04379
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.CC,
cs.DM,
math.CO
Citations
8
Venue
Information Processing Letters
Last Checked
4 months ago
Abstract
A graph is $H$-free if it does not contain an induced subgraph isomorphic to $H$. For every integer $k$ and every graph $H$, we determine the computational complexity of $k$-Edge Colouring for $H$-free graphs.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted