Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Graph Similarity and Homomorphism Densities

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
Read More Add to Saved list
  • Author(s): Böker, Jan Wilhelm
  • Source:
    Saarbrücken/Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Leibniz international proceedings in informatics 198, 17 pages803851 bytes (2021). doi:10.4230/LIPIcs.ICALP.2021.32 ; 48th International Colloquium on Automata, Languages, and Programming : ICALP 2021, July 12-16, 2021, Glasgow, Scotland (virtual conference) / edited by Nikhil Bansal, Emanuela Merelli, James Worrell ; 48th International Colloquium on Automata, Languages, and Programming : ICALP 2021, July 12-16, 2021, Glasgow, Scotland (virtual conference) / edited by Nikhil Bansal, Emanuela Merelli, James Worrell 48. International Colloquium on Automata, Languages, and Programming, ICALP 2021, online, 2021-07-12 - 2021-07-16
  • Subject Terms:
    Mathematics of computing → Graph theory; cut distance; graph similarity; homomorphism densities
  • Document Type:
    conference object
  • Language:
    English
  • Additional Information
    • Publication Information:
      Schloss Dagstuhl - Leibniz-Zentrum für Informatik
    • Publication Date:
      2021
    • Collection:
      RWTH Aachen University: RWTH Publications
    • Subject Terms:
      DE
    • Online Access:
      https://publications.rwth-aachen.de/record/822867
      https://publications.rwth-aachen.de/search?p=id:%22RWTH-2021-07044%22
    • Rights:
      info:eu-repo/semantics/openAccess
    • Accession Number:
      edsbas.40EBDAD8