Spectral aspects of symmetric matrix signings
DOI10.1016/j.disopt.2020.100582zbMath1506.68068OpenAlexW3023748707MaRDI QIDQ783041
Karthekeyan Chandrasekaran, Hsien-Chih Chang, Alexandra Kolla, Naonori Kakimura, Charles Carlson
Publication date: 30 July 2020
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11025/
Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalization of combinatorial Nullstellensatz
- Finding small stabilizers for unstable graphs
- The minimum rank of symmetric matrices described by a graph: a survey
- Fractional matchings and the Edmonds-Gallai theorem
- Balancing signed graphs
- Signed graphs
- A simple algorithm to detect balance in signed graphs
- Studies on the balancing, the minimal balancing, and the minimum balancing processes for social groups with planar and nonplanar graph structures
- The optimal path-matching problem
- Relative expanders or weakly relatively Ramanujan graphs.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Partitions of nonzero elements of a finite field into pairs
- Some criteria for a signed graph to have full rank
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- The parity of the number of 1-factors of a graph
- On the notion of balance of a signed graph
- The Geometry of Root Systems and Signed Graphs
- Integer and Fractional Matchings
- Combinatorial Nullstellensatz
- Reducibility among Combinatorial Problems
- Paths, Trees, and Flowers
- Optimal Edge Deletions for Signed Graph Balancing
This page was built for publication: Spectral aspects of symmetric matrix signings
