OpenAlex
PricingAboutJobs
Log inGet started
Work

On Weisfeiler-Leman invariance: Subgraph counts and related graph properties

HTML

Year: 2020
Type: article
Source: Journal of Computer and System Sciences
DOI: 10.1016/j.jcss.2020.04.003
Authors: V. Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
Institutions: Institute of Mathematical Sciences, Humboldt-Universität zu Berlin
Language: English

Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: Weisfeiler-Leman algorithm, graph isomorphism, color refinement, subgraph counting, graph similarity, descriptive complexity, subgraph patterns

Open Access status: bronze

Funder: Deutsche Forschungsgemeinschaft
OpenAlex ID: W2965757697
FWCI: 11.97
Cites: 57
Cited by: 115
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security