Logarithmic Weisfeiler-Leman Identifies All Planar Graphs
Logarithmic Weisfeiler-Leman Identifies All Planar Graphs
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, online, 12 Jul 2021 - 16 Jul 2021; Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, LIPIcs - Leibniz International Proceedings in Informatics 198, 134:1-134:20 (2021). doi:10.4230/LIPICS.ICALP.2021.134
Published by Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Wadern
- RWTH Aachen University Germany
- Schloss Dagstuhl – Leibniz Center for Informatics Germany
- RWTH Aachen University (Medical Faculty) Germany
- Leibniz Association Germany
- University of Warsaw Poland
FOS: Computer and information sciences, Weisfeiler-Leman algorithm, Computer Science - Logic in Computer Science, Mathematics of computing → Graph theory, quantifier depth, Discrete Mathematics (cs.DM), Computational Complexity (cs.CC), Theory of computation → Finite Model Theory, planar graphs, 004, Logic in Computer Science (cs.LO), finite-variable logic, Computer Science - Computational Complexity, FOS: Mathematics, Mathematics - Combinatorics, iteration number, Combinatorics (math.CO), isomorphism testing, Computer Science - Discrete Mathematics, ddc: ddc:004
FOS: Computer and information sciences, Weisfeiler-Leman algorithm, Computer Science - Logic in Computer Science, Mathematics of computing → Graph theory, quantifier depth, Discrete Mathematics (cs.DM), Computational Complexity (cs.CC), Theory of computation → Finite Model Theory, planar graphs, 004, Logic in Computer Science (cs.LO), finite-variable logic, Computer Science - Computational Complexity, FOS: Mathematics, Mathematics - Combinatorics, iteration number, Combinatorics (math.CO), isomorphism testing, Computer Science - Discrete Mathematics, ddc: ddc:004
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!