The following pages link to Matthieu Latapy (Q208938):
Displayed 35 items.
- Item:Q208938 (redirect page) (← links)
- On the termination of some biclique operators on multipartite graphs (Q496448) (← links)
- Post-processing hierarchical community structures: quality improvements and multi-scale view (Q627194) (← links)
- Describing and simulating internet routes (Q878729) (← links)
- Computing maximal cliques in link streams (Q897884) (← links)
- Main-memory triangle computations for very large (sparse (power-law)) graphs (Q955020) (← links)
- The lattice of integer partitions and its infinite extension (Q1024442) (← links)
- Enumerating maximal cliques in link streams with durations (Q1705705) (← links)
- The lattice of Delannoy paths (Q1850062) (← links)
- Coding distributive lattices with Edge Firing Games. (Q1853051) (← links)
- Sandpile models and lattices: a comprehensive survey (Q1885925) (← links)
- Pattern matching in link streams: a token-based approach (Q2280189) (← links)
- Bipartite structure of all complex networks (Q2390254) (← links)
- Detection, understanding, and prevention of traceroute measurement artifacts (Q2482001) (← links)
- Relevance of massively distributed explorations of the internet topology: qualitative results (Q2509335) (← links)
- Graph encoding of 2D-gon tilings (Q2581345) (← links)
- Impact of random failures and attacks on Poisson and power-law random networks (Q2875051) (← links)
- Termination of Multipartite Graph Series Arising from Complex Network Modelling (Q3066139) (← links)
- Partitions of an Integer into Powers (Q4331210) (← links)
- Integer Partitions, Tilings of<i>2D</i>-gons and Lattices (Q4405556) (← links)
- (Q4502540) (← links)
- Pattern Matching in Link Streams: Timed-Automata with Finite Memory (Q4621222) (← links)
- Efficient and simple generation of random simple connected graphs with prescribed degree sequence (Q4689375) (← links)
- (Q4708654) (← links)
- Complex Networks and Link Streams for the Empirical Analysis of Large Software (Q5166755) (← links)
- Computing Communities in Large Networks Using Random Walks (Q5301388) (← links)
- (Q5321523) (← links)
- Fast computation of empirically tight bounds for the diameter of massive graphs (Q5406179) (← links)
- Principles of Distributed Systems (Q5713663) (← links)
- Computing and Combinatorics (Q5716963) (← links)
- The lattice structure of chip firing games and related models (Q5946134) (← links)
- Structure of some sand piles model (Q5958135) (← links)
- Computing Betweenness Centrality in Link Streams (Q6107025) (← links)
- A frequency-structure approach for link stream analysis (Q6119477) (← links)
- Generalized Tilings with Height Functions (Q6358691) (← links)