π
π
The Cartographer
Maximum Independent Sets in Subcubic Graphs: New Results
October 25, 2018 Β· Declared Dead Β· π International Workshop on Graph-Theoretic Concepts in Computer Science
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Ararat Harutyunyan, Michael Lampis, Vadim Lozin, JΓ©rΓ΄me Monnot
arXiv ID
1810.10940
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.DM
Citations
8
Venue
International Workshop on Graph-Theoretic Concepts in Computer Science
Last Checked
4 months ago
Abstract
The maximum independent set problem is known to be NP-hard in the class of subcubic graphs, i.e. graphs of vertex degree at most 3. We present a polynomial-time solution in a subclass of subcubic graphs generalizing several previously known results.
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