{"version.version":"0.0.7","version.cm_url":"https://github.com/ceurws/ceur-spt","spt.html_url":"/Vol-3341/kdml705.html","spt.description":null,"spt.id":"Vol-3341/kdml705","spt.wikidataid":null,"spt.title":"A Simple Heuristic for the Graph Tukey Depth Problem with Potential Applications to Graph Mining","spt.pdfUrl":"https://ceur-ws.org/Vol-3341/KDML-LWDA_2022_CRC_705.pdf","spt.volume":{"number":3341,"acronym":"LWDA 2022","wikidataid":"Q116797001","title":"Proceedings of the LWDA 2022 Workshops: FGWM, FGKD, and FGDB","description":"Proceedings of LWDA 2022","url":"http://ceur-ws.org/Vol-3341/","date":"2023-02-11","dblp":"conf/lwa/2022","k10plus":"1842080792","urn":"urn:nbn:de:0074-3341-3"},"spt.session":null,"cvb.id":"Vol-3341/kdml705","cvb.title":"A Simple Heuristic for the Graph Tukey Depth Problem with Potential Applications to Graph Mining","cvb.type":null,"cvb.position":null,"cvb.pagesFrom":null,"cvb.pagesTo":null,"cvb.authors":"Florian Seiffarth,Tamás Horváth,Stefan Wrobel","cvb.vol_number":"3341","cvb.pdf_name":"KDML-LWDA_2022_CRC_705.pdf","cvb.pages":"21-32","cvb.fail":null,"dblp.dblp_publication_id":"https://dblp.org/rec/conf/lwa/Seiffarth0W22","dblp.dblp_proceeding_id":"https://dblp.org/rec/conf/lwa/2022","dblp.volume_number":3341,"dblp.title":"A Simple Heuristic for the Graph Tukey Depth Problem with Potential Applications to Graph Mining.","dblp.authors":[{"dblp_author_id":"https://dblp.org/pid/256/5399","label":"Florian Seiffarth","wikidata_id":null,"orcid_id":null,"gnd_id":null},{"dblp_author_id":"https://dblp.org/pid/55/6464-1","label":"Tamás Horváth 0001","wikidata_id":null,"orcid_id":"0000-0001-6852-6939","gnd_id":null},{"dblp_author_id":"https://dblp.org/pid/w/StefanWrobel","label":"Stefan Wrobel","wikidata_id":"Q60029549","orcid_id":null,"gnd_id":"1221685376"}],"dblp.pdf_id":"Vol-3341/KDML-LWDA_2022_CRC_705"}