New solutions for disjoint paths in P systems
DOI10.1007/S11047-012-9342-9zbMATH Open1331.68287OpenAlexW2787687967MaRDI QIDQ256435FDOQ256435
Authors: Radu Nicolescu, Huiling Wu 
Publication date: 9 March 2016
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-012-9342-9
Recommendations
- Fast distributed DFS solutions for edge-disjoint paths in digraphs
- BFS Solution for Disjoint Paths in P Systems
- Distributed algorithms for computing shortest pairs of disjoint paths
- Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids
- An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm
digraphsbreadth-first searchCidon's depth-first searchdepth-first searchdistributed algorithmsedge-disjoint pathsEdmonds-KarpFord-Fulkersonmessage-basednetwork flownode-disjoint pathsP systemssynchronous
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Flows in graphs (05C21) Paths and cycles (05C38) Distributed algorithms (68W15)
Cites Work
- Maximal Flow Through a Network
- Computing with membranes
- New solutions for disjoint paths in P systems
- BFS Solution for Disjoint Paths in P Systems
- A faster P solution for the Byzantine agreement problem
- Title not available (Why is that?)
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Introduction to Distributed Algorithms
- Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout
Cited In (6)
- New solutions for disjoint paths in P systems
- Testing based on identifiable P systems using cover automata and X-machines
- Fast distributed DFS solutions for edge-disjoint paths in digraphs
- Time-free solution to Hamilton path problems using P systems with \(d\)-division
- BFS Solution for Disjoint Paths in P Systems
- A linear time complexity of breadth-first search using P system with membrane division
Uses Software
This page was built for publication: New solutions for disjoint paths in P systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256435)
