Frank Gurski
- Line graphs of bounded clique-width
2007/02/17 by Frank Gurski, Egon Wanke · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Bounded function #Chordal graph #Clique #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Graph #Graph theory and applications #Independent set #Line graph #Mathematical analysis #Mathematics #Path (computing) #Pathwidth #Treewidth
- Knapsack Problems: A Parameterized Point of View
2016/11/23 by Carolin Albrecht, Albrecht, Carolin, Frank Gurski +5 · 1 citation
Computer Science · Engineering · #Advanced Graph Theory Research #Optimization and Packing Problems #Optimization and Search Problems #cs.CC #cs.DS
- Comparing Linear Width Parameters for Directed Graphs
2018/12/17 by Frank Gurski, Gurski, Frank, Carolin Rehs +1 · 1 citation
Computer Science · Mathematics · #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #cs.DS #math.CO
- The Behavior of Tree-Width and Path-Width under Graph Operations and Graph Transformations
2024/06/13 by Frank Gurski, Robin Weishaupt, Gurski, Frank +1 · 1 citation
Computer Science · Engineering · Mathematics · #05C76 #68R10 #Advanced Graph Theory Research #Butterfly graph #Combinatorics #Computer network #Computer science #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Graph #Graph Theory and Algorithms #Line graph #Mathematics #Path (computing) #Theoretical computer science #VLSI and FPGA Design Techniques #Voltage graph