Compact Flow Diagrams for State Sequences

DOI10.1145/3150525zbMath1414.68038arXiv1602.05622OpenAlexW3121764566MaRDI QIDQ4577949

Maike Buchin, Stef Sijben, Joachim Gudmundsson, Michael Horton, Kevin Buchin

Publication date: 6 August 2018

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.05622

zbMATH Keywords

footballnetwork analysisexperimentalflow networkssports analyticsstate sequencegroup segmentation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Fréchet Distance for Uncertain Curves

Cites Work

• Unnamed Item
• The shortest common supersequence problem over binary alphabet is NP- complete
• On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
• Median trajectories
• DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES
• On the hardness of approximating minimization problems
• Segmentation of Trajectories on Non-Monotone Criteria

This page was built for publication: Compact Flow Diagrams for State Sequences