- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2364-1541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Modular Decomposition-Based Graph Compression for Fast Reachability Detection ; volume:4 ; number:3 ; day:30 ; month:8 ; year:2019 ; pages:193-207 ; date:9.2019
Data science and engineering ; 4, Heft 3 (30.8.2019), 193-207, 9.2019
- Creator
-
Anirban, Shikha
Wang, Junhu
Islam, Md. Saiful
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s41019-019-00099-9
- URN
-
urn:nbn:de:101:1-2020020717541152149683
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 14.08.2025, 10:44 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Anirban, Shikha
- Wang, Junhu
- Islam, Md. Saiful
- SpringerLink (Online service)
Other Objects (12)
Computing well-covered vector spaces of graphs using modular decomposition
Efficient and practical modular decomposition
Graph automorphisms for compression
Tetrahedral modular graph functions
Modular decomposition of protein-protein interaction networks
Comparing biological networks via graph compression
Graph Compression for Adjacency-Matrix Multiplication
GraphZIP: a clique-based sparse graph compression method
Hierarchy of modular graph identities
Relations between elliptic modular graphs
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees
Graph decomposition in routing and compilers
Computing well-covered vector spaces of graphs using modular decomposition
Efficient and practical modular decomposition
Graph automorphisms for compression
Tetrahedral modular graph functions
Modular decomposition of protein-protein interaction networks
Comparing biological networks via graph compression
Graph Compression for Adjacency-Matrix Multiplication
GraphZIP: a clique-based sparse graph compression method
Hierarchy of modular graph identities
Relations between elliptic modular graphs
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees
Graph decomposition in routing and compilers
Computing well-covered vector spaces of graphs using modular decomposition
Efficient and practical modular decomposition
Graph automorphisms for compression
Tetrahedral modular graph functions
Modular decomposition of protein-protein interaction networks
Comparing biological networks via graph compression
Graph Compression for Adjacency-Matrix Multiplication
GraphZIP: a clique-based sparse graph compression method
Hierarchy of modular graph identities
Relations between elliptic modular graphs
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees