The following pages link to Alicia Miralles (Q606724):
Displaying 10 items.
- A fast and efficient algorithm to identify clusters in networks (Q606725) (← links)
- (Q1672980) (redirect page) (← links)
- The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs (Q1672982) (← links)
- On the approximation of delay elements by feedback (Q1973995) (← links)
- Label-based routing for a family of scale-free, modular, planar and unclustered graphs (Q3004925) (← links)
- (Q3576711) (← links)
- (Q3625864) (← links)
- Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks (Q3654248) (← links)
- LYAPUNOV EXPONENTS FOR BILINEAR SYSTEMS: APPLICATION TO THE BUCK CONVERTER (Q4653810) (← links)
- (Q5716466) (← links)
