85 citations · 152 across the 6 of their papers we have counts for
6 papers
Routes Obey Hierarchy in Complex Networks
Attila Csoma, Attila Kőrösi, Gábor Rétvári +7
Various hypotheses exist about the paths used for communication between the nodes of complex networks. Most studies simply suppose that communication goes via shortest paths, while…
Geometric explanation of the rich-club phenomenon in complex networks
Máté Csigi, Attila Kőrösi, József Bíró +3
The rich club organization (the presence of highly connected hub core in a network) influences many structural and functional characteristics of networks including topology, the ef…
Deductive Way of Reasoning about the Internet AS Level Topology
Dávid Szabó, Attila Kőrösi, József Bíró +1
Our current understanding about the AS level topology of the Internet is based on measurements and inductive-type models which set up rules describing the behavior (node and edge d…
Navigable Networks as Nash Equilibria of Navigation Games
András Gulyás, József Bíró, Attila Kőrösi +2
The common sense suggests that networks are not random mazes of purposeless connections, but that these connections are organised so that networks can perform their functions well.…
Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond
Gábor Rétvári, János Tapolcai, Attila Kőrösi +2
Lately, there has been an upsurge of interest in compressed data structures, aiming to pack ever larger quantities of information into constrained memory without sacrificing the ef…
Memory size bounds of prefix DAGs
János Tapolcai, Gábor Rétvári, Attila Kőrösi
In this report an entropy bound on the memory size is given for a compression method of leaf-labeled trees. The compression converts the tree into a Directed Acyclic Graph (DAG) by…