Average-case complexity of the min-sum matrix product problem

rder Abstract Voronoi Diagrams. Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou and Maksym Zavershynskyi 3D rectangulations and geometric matrix multiplication. Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas and Dzmitry Sledneu 11:45-13:30 Lunch 13:30-14:45 Graph Algorithms: Enumeration / Ryuhei Uehara Matching and Assignment I / Kun-Mao Chao Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay. Andre Droschinsky, Bernhard Heinemann, Nils Kriege and Petra Mutzel Planar Matchings for Weighted Straight Skeletons. Therese Biedl, Stefan Huber and Peter Palfrader Session 2 Efficient Enumeration of Induced Subtrees in a KDegenerate Graph. Kunihiro Wasa, Hiroki Arimura and Takeaki Uno Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries. Meng He, Ganggui Tang and Norbert Zeh An Efficient Method for Indexing All Topological Orders of a Directed Graph. Yuma Inoue and Shin-Ichi Minato Dynamic and Multi-functional La...

• Type: Journal
• Year: 2016
• Where: TCS
• Authors: Ken C. K. Fong, Minming Li, Hongyu Liang, Linji Yang, Hao Yuan
• Keywords: TCS 2016, Theoretical Computer Science