An Algorithm to Automatically Generate the Combinatorial Orbit Counting Equations.
Graphlets are small subgraphs, usually containing up to five vertices, that can be found in a larger graph. Identification of the graphlets that a vertex in an explored graph touches can provide useful information about the local structure of the graph around that vertex. Actually finding all graphl...
Saved in:
| Main Authors: | Ine Melckenbeeck, Pieter Audenaert, Tom Michoel, Didier Colle, Mario Pickavet |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2016-01-01
|
| Series: | PLoS ONE |
| Online Access: | https://doi.org/10.1371/journal.pone.0147078 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The index-based subgraph matching algorithm (ISMA): fast subgraph enumeration in large networks using optimized search trees.
by: Sofie Demeyer, et al.
Published: (2013-01-01) -
Automated Incident Detection Using Real-Time Floating Car Data
by: Maarten Houbraken, et al.
Published: (2017-01-01) -
Multi-timescale scheme for cooperative user association and hybrid beamforming in mmWave MIMO systems
by: Mohammadreza Heydarian, et al.
Published: (2025-07-01) -
Counting Closed Orbits for the Dyck Shift
by: Fahad Alsharari, et al.
Published: (2014-01-01) -
Partition Differential Equations and Some Combinatorial Algebraic Structures
by: Adnan Hashim Abdulwahid
Published: (2024-11-01)