venueno aff
Different Formulations for Solving the Heaviest<i>K</i>-Subgraph Problem2005· article· en· INFOR Information Systems and Operational Research· Computer Science
48
citations
Every work in the frame. Each row carries the routes that admitted it, because a frame that forgets how it found something cannot be audited.