Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
Saved in:
| Published in: | ArXiv cs.DS Recent Papers |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2026
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
- An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
- Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition
- Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
- New Bounds for Kernel Sums via Fast Spherical Embeddings
- A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
- Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial