scientific article; zbMATH DE number 7559088
From MaRDI portal
Publication:5090422
DOI10.4230/LIPIcs.ITCS.2019.45MaRDI QIDQ5090422
Elchanan Mossel, Yan Jin, Govind Ramnarayan
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1809.10325
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- The \(k\)-separator problem: polyhedra, complexity and approximation results
- Graph expansion and the unique games conjecture
- Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems
- An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
- A diagnosing algorithm for networks
- On Models for Diagnosable Systems and Probabilistic Fault Diagnosis
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Characterization of Connection Assignment of Diagnosable Systems
- Sequentially t-diagnosable systems: a characterization and its applications
- Partitioning a Graph into Small Pieces with Applications to Path Transversal
- Distributed Corruption Detection in Networks
- Disconnecting graphs by removing vertices: a polyhedral approach
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
This page was built for publication:
