Path Bundling in Modular Bipartite Networks

No abstract is available for this paper.

• Publication year

  2017

• Venue

  International Conference on Simulation and Modeling Methodologies, Technologies and Applications

• Publication date

  2017-07-29

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1007/978-3-030-01470-4_12
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Dynamic coverage control for mobile robot network with limited and nonidentical sensory ranges

  2017cited by this paper
• Computing Path Bundles in Bipartite Networks

  2017cited by this paper
• On succinct representation of directed graphs

  2017cited by this paper
• Global Planning for Multi-Robot Communication Networks in Complex Environments

  2016cited by this paper
• On k-subset sum using enumerative encoding

  2016cited by this paper
• Automatic routing of flexible 1D components with functional and manufacturing constraints

  2016cited by this paper
• Optimization of ZigBee Networks using Bundled Routes

  2015cited by this paper
• An evolutionary based topological optimization strategy for consensus based clock synchronization protocols in wireless sensor network

  2015cited by this paper
• Improving Differential Evolution With a Successful-Parent-Selecting Framework

  2015cited by this paper
• Distributed adaptive node-specific signal estimation in heterogeneous and mixed-topology wireless sensor networks

  2015cited by this paper
• Bijections for the numeric representation of labeled graphs

  2014cited by this paper
• A survey on cluster-based routing protocols in wireless sensor networks

  2014cited by this paper
• An energy-efficient topology construction algorithm for wireless sensor networks

  2013cited by this paper
• Success-history based parameter adaptation for Differential Evolution

  2013cited by this paper
• Niching particle swarm optimization with local search for multi-modal optimization

  2012cited by this paper
• Divided Edge Bundling for Directional Network Data

  2011cited by this paper
• Skeleton-Based Edge Bundling for Graph Visualization

  2011cited by this paper
• Multilevel agglomerative edge bundling for visualizing large graphs

  2011cited by this paper
• A family of simple distributed minimum connected dominating set-based topology construction algorithms

  2011cited by this paper
• Force‐Directed Edge Bundling for Graph Visualization

  2009cited by this paper
• Geometry-Based Edge Clustering for Graph Visualization

  2008cited by this paper
• Differential evolution and non-separability: using selective pressure to focus search

  2007cited by this paper
• Shape distributions

  2002cited by this paper
• Introduction to Algorithms

  1991cited by this paper
• Euclidean shortest paths in the presence of rectilinear barriers

  1984cited by this paper
• A theorem on polygon cutting with applications

  1982cited by this paper
• A Formal Basis for the Heuristic Determination of Minimum Cost Paths

  1968cited by this paper
• A note on two problems in connexion with graphs

  1959cited by this paper

• Automatic cable harness layout routing in a customizable 3D environment

  2023cites this paper