Interactively Exploring the Connection between Bidirectional Compression and Star Bicoloring | Zendy

M. Ali Rostami | Zendy; H. Martin Bücker | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Interactively Exploring the Connection between Bidirectional Compression and Star Bicoloring

Author(s) -

M. Ali Rostami,

H. Martin Bücker

Publication year - 2015

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2015.05.456

Subject(s) - computer science , connection (principal bundle) , star (game theory) , theoretical computer science , graph , a* search algorithm , compression (physics) , algorithm , mathematics , composite material , mathematical analysis , materials science , geometry

The connection between scientific computing and graph theory is detailed for a problem called bidirectional compression. This problem consists of finding a pair of seed matrices in automatic differentiation. In terms of graph theory, the problem is nothing but finding a star bicoloring. An interactive educational module is designed and implemented to illustrate the connection between bidirectional compression and star bicoloring. The web-based module is intended to be used in the classroom to illustrate the intricate nature of this combinatorial problem

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research