Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles
Main Authors: | Dalirrooyfard, Mina, Vuong, Thuy Duong, Williams, Virginia Vassilevska |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
Society for Industrial & Applied Mathematics (SIAM)
2022
|
Online Access: | https://hdl.handle.net/1721.1/143941 |
Similar Items
-
Graph pattern detection: Hardness for all induced patterns and faster non-induced cycles
by: Dalirrooyfard, Mina, et al.
Published: (2021) -
Hardness of Approximate Diameter: Now for Undirected Graphs
by: Dalirrooyfard, Mina, et al.
Published: (2024) -
Hardness of Approximate Diameter: Now for Undirected Graphs
by: Dalirrooyfard, Mina, et al.
Published: (2022) -
Finding Patterns, Short Cycles and Long Shortest Paths in Graphs
by: Dalirrooyfard, Mina
Published: (2022) -
Conditionally optimal approximation algorithms for the girth of a directed graph
by: Dalirrooyfard, Mina, et al.
Published: (2021)