Multiaspect graphs: algebraic representation and algorithms

DOI10.3390/a10010001zbMath1461.68168arXiv1504.07893OpenAlexW1493312012MaRDI QIDQ1662581

Éric Fleury, Artur Ziviani, Klaus Wehmuth

Publication date: 20 August 2018

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.07893

zbMATH Keywords

time-varying networkgraph algorithmscomplex networkmultilayer networkhigh-order network

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Cops \& robber on periodic temporal graphs: characterization and improved bounds ⋮ Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs ⋮ Efficiency centrality in time-varying graphs ⋮ On multiaspect graphs ⋮ Algorithmic networks: central time to trigger expected emergent open-endedness ⋮ A hybrid adjacency and time-based data structure for analysis of temporal networks

Uses Software

• Python

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On multiaspect graphs
• Computing the eccentricity distribution of large graphs
• Editorial: Special issue on graph algorithms
• Emergence of Scaling in Random Networks
• Collective dynamics of ‘small-world’ networks
• Digraphs
• Depth-First Search and Linear Graph Algorithms
• Graphs and matrices

This page was built for publication: Multiaspect graphs: algebraic representation and algorithms