Michael A. Langston
- Nonconstructive tools for proving polynomial-time decidability
1988/06/01 by Michael R. Fellows, Michael A. Langston · 5 citations
Computer Science · Mathematics · #Formal Methods in Verification #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Decidability #Time complexity #Computer science #Decision problem #Graph #Set (abstract data type) #Theoretical computer science #Graph theory #Mathematics #Discrete mathematics #Algorithm #Combinatorics
- Practical in-place merging
1988/03/01 by Bing-Chao Huang, Michael A. Langston · 2 citations
Computer Science · Decision Sciences · #Data Management and Algorithms #Advanced Database Systems and Queries #Data Quality and Management
- Chapter 8 Algorithmic implications of the graph minor theorem
1995/01/01 by Daniel Bienstock, Michael A. Langston · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Complexity and Algorithms in Graphs #Robertson–Seymour theorem #Graph minor #Discrete mathematics #Mathematics #Planarity testing #Minor (academic) #Lemma (botany) #Fundamental theorem #Graph property #Combinatorics #Perfect graph theorem #Graph #Line graph #Pathwidth #Voltage graph #Fixed-point theorem