Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
Despite of their applicability betweennness constraints have (to the authorās knowledge) hardly been considered from the random structures point of view. They are essentially diļ...
Maintaining both overview and detail while navigating in graphs, such as road networks, airline route maps, or social networks, is difļ¬cult, especially when targets of interest ...
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. ...