3 citations · 6 across the 8 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CC2016
The Minrank of Random Graphs
Alexander Golovnev, Oded Regev, Omri Weinstein
The minrank of a graph is the minimum rank of a matrix that can be obtained from the adjacency matrix of by switching some ones to zeros (i.e., deleting edges) and then…
cs.DS2016
Tight Lower Bounds on Graph Embedding Problems
Marek Cygan, Fedor V. Fomin, Alexander Golovnev +4
We prove that unless the Exponential Time Hypothesis (ETH) fails, deciding if there is a homomorphism from graph to graph cannot be done in time . We al…