- Multi-agent Path Planning and Network Flow
2012/04/25 by Jingjin Yu, Yu, Jingjin, Steven M. LaValle +1 · 9 citations
Computer Science · Engineering · Mathematics · #Artificial intelligence #Computer science #Connection (principal bundle) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Electrical engineering #Flow network #Graph #Longest path problem #Mathematical optimization #Mathematics #Motion planning #Network planning and design #Pairwise comparison #Path (computing) #Permutation (music) #Robotic Path Planning Algorithms #Robotics (cs.RO) #Shortest path problem #Systems and Control (eess.SY) #Theoretical computer science #Vehicle Routing Optimization Methods #electronic engineering #information engineering
- Clique Graphs of Chordal and Path Graphs
1994/05/01 by Jayme L. Szwarcfiter, Claudson F. Bornstein · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Graph theory and applications #Complexity and Algorithms in Graphs #Chordal graph #Combinatorics #Split graph #Mathematics #Block graph #Treewidth #Indifference graph #Pathwidth #Clique-sum #Discrete mathematics #Interval graph #Cograph #Longest path problem #Graph #1-planar graph #Line graph
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width
1994/03/01 by Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani · 1 citation
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Bounded function #Chordal graph #Combinatorics #Computer science #Discrete mathematics #Graph #Indifference graph #Induced path #Interconnection Networks and Systems #Limits and Structures in Graph Theory #Line graph #Longest path problem #Mathematics #Minor (academic) #Path (computing) #Pathwidth #Robertson–Seymour theorem