HIGHLIGHTS
- who: Gregory Rosenthal from the University of Toronto, Canada have published the paper: Beating Treewidth for Average-Case Subgraph Isomorphism, in the Journal: (JOURNAL)
- what: The authors show that emb(G) is at most O(κ(G)) for all graphs G. Next the authors show less than tw(G); for example if G is a hypercube that κ(G) can be asymptotically then κ(G) is Θ tw(G) p log tw(G).
SUMMARY
Keyword and phrases subgraph isomorphism, average-case complexity, AC0, circuit complexity Digital Object Identifier 10.4230/LIPIcs.IPEC.2019.24 Related . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.