Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics
From MaRDI portal
Publication:3132937
DOI10.1142/S0218127417502157zbMath1382.68162OpenAlexW2786956989MaRDI QIDQ3132937
Kittichai Lavangnananda, Grégoire Danoy, Martin Rosalie, Pascal Bouvry, Boonyarit Changaival
Publication date: 31 January 2018
Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218127417502157
Graph theory (including graph drawing) in computer science (68R10) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Random walks on graphs (05C81)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Firefly algorithm with chaos
- Chaos-enhanced accelerated particle swarm optimization
- Setting port numbers for fast graph exploration
- Constructing competitive tours from local information
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- Dynamics of a Hénon-Lozi-type map
- Fast chaotic optimization algorithm based on locally averaged strategy and multifold chaotic attractor
- Online graph exploration algorithms for cycles and trees by multiple searchers
- Vertex-ant-walk -- a robust method for efficient exploration of faulty graphs
- Coverage for robotics -- a survey of recent results
- An improved particle swarm optimization algorithm combined with piecewise linear chaotic map
- An equation for continuous chaos
- Improved particle swarm optimization combined with chaos
- Graph exploration by a finite automaton
- Templates and subtemplates of Rössler attractors from a bifurcation diagram
- EMERGENCE OF RANDOMNESS FROM CHAOS
- Non-strange chaotic attractors equivalent to their templates
- Bifurcations in the Lozi map
- Random walks on weighted graphs and applications to on-line algorithms
- Toward a General Procedure for Extracting Templates from Chaotic Attractors Bounded by High Genus Torus
- AN OPTIMIZATION METHOD INSPIRED BY "CHAOTIC" ANT BEHAVIOR
- Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Mersenne twister
- YET ANOTHER CHAOTIC ATTRACTOR
- Deterministic Nonperiodic Flow
- A Brief History of Generative Models for Power Law and Lognormal Distributions
- A universal circuit for studying and generating chaos. II. Strange attractors
- Exploring Unknown Undirected Graphs
- Exploring Unknown Environments
- On a simple depth-first search strategy for exploring unknown graphs
- Collective dynamics of ‘small-world’ networks
- Use of Ranks in One-Criterion Variance Analysis
This page was built for publication: Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics
