Skip to search formSkip to main contentSkip to account menu

Apollonian network

In combinatorial mathematics, an Apollonian network is an undirected graph formed by a process of recursively subdividing a triangle into three… 
Wikipedia (opens in a new tab)

Related topics

Related topics

44 relations
Alan M. FriezeApollonian gasketBarycentric subdivisionBiconnected component

Broader (1)

Triangulation (geometry)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Reconfigurable optical mobile fronthaul networks for coordinated multipoint transmission and reception in 5G
The fifth generation of mobile communication is characterized by ultra-dense cellular networks, where massive small cells are… 
Highly Cited
2013
Highly Cited
2013
Mobility Increases the Connectivity of Wireless Networks
In this paper, we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect… 
Highly Cited
2002
Highly Cited
2002
Connectivity distribution and attack tolerance of general networks with both preferential and random attachments
Highly Cited
2001
Highly Cited
2001
A 2.7V CMOS dual-mode baseband filter for PDC and WCDMA
An 5th order analog CMOS RC-opamp baseband filter for a dual-mode cellular phone receiver was designed with maximum component… 
Highly Cited
2000
Highly Cited
2000
Fixed-Point Models for the End-to-End Performance Analysis of IP Networks
This paper presents a new approach to modeling end-toend performance for IP networks. Unlike earlier models, in which end… 
1997
1997
AAL-2 — A new ATM adaptation layer for small packet encapsulation and multiplexing
Asynchronous transfer mode (ATM) networks carry fixed-size cells within the network irrespective of the applications being… 
Highly Cited
1977
Highly Cited
1977
The Looping Algorithm Extended to Base 2tRearrangeable Switching Networks
Clos Rearrangeable Switching Networks (RSN's) are examined with regard to properties of imprimitivity. It is shown that a certain… 
Highly Cited
1973
Highly Cited
1973
Complete Test Sets for Logic Functions
The problem of designing fault detecting test sets from the functional description rather than the structural description of the… 
Highly Cited
1971
Highly Cited
1971
Memristor-The Missing Circuit Element LEON 0
A new two-terminal circuit element-called the memrirtorcharacterized by a relationship between the charge q(t) s St% i(7J d7 and… 
Highly Cited
1959
Highly Cited
1959
Applications of matrix algebra to network theory
In this paper some properties of unimodular (or E -) and paramount (or M -) matrices are discussed. The paper deals with matrices… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)