{"labels":{"en":"A Simple Heuristic for the Graph Tukey Depth Problem with Potential Applications to Graph Mining"},"descriptions":{"en":"scientific paper published in CEUR-WS Volume 3341"},"claims":{"P31":"Q13442814","P1433":"Q116797001","P1476":{"text":"A Simple Heuristic for the Graph Tukey Depth Problem with Potential Applications to Graph Mining","language":"en"},"P407":"Q1860","P953":"https://ceur-ws.org/Vol-3341/KDML-LWDA_2022_CRC_705.pdf","P50":[{"value":"Q60029549","qualifiers":{"P1545":"3"}}],"P2093":[{"value":"Florian Seiffarth","qualifiers":{"P1545":"1"}},{"value":"Tamás Horváth","qualifiers":{"P1545":"2"}}]}}