I/O-efficient strong connectivity and depth-first search for directed planar graphs

Keyphrases

• Planar Graph 100%
• Depth-first 100%
• Strong Connectivity 100%
• Depth-first Search 100%
• Strongly Connected Components 50%
• Main Memory 50%
• Separator 50%
• Simple Path 50%
• Number of Elements 50%
• I/O-efficient Algorithms 50%
• Spanning Tree 50%
• Graph Finding 50%

Computer Science

• Planar Graph 100%
• Input/Output 100%
• Main Memory 50%
• Spanning Tree 50%
• Fundamental Problem 50%
• Strongly Connected Component 50%
• Efficient Algorithm 50%