We show that the independent set reconfiguration problem on split graphs under the token sliding rule is PSPACE-complete.
from cs updates on arXiv.org https://ift.tt/2LmTyzs
//
Token Sliding on Split Graphs. (arXiv:1807.05322v1 [cs.DS])
July 17, 2018 / / in cs updates on arXiv.org / with No comments /
from cs updates on arXiv.org https://ift.tt/2LmTyzs
//
Related Posts:
Learning tensors from partial binary measurements. (arXiv:1804.00108v1 [math.ST])- A Segmentation-aware Deep Fusion Network for Compressed Sensing MRI. (arXiv:1804.01210v1 [cs.CV])
- Unreasonable Effectivness of Deep Learning. (arXiv:1803.10768v1 [cs.LG])
- A Euclidean Algorithm for Binary Cycles with Minimal Variance. (arXiv:1804.01207v1 [cs.DS])
- Network Traffic Anomaly Detection Using Recurrent Neural Networks. (arXiv:1803.10769v1 [cs.CY])
0 comments:
Post a Comment