SIAM J. COMPUT. Vol. 42, No. 3, pp. 733–751 - Path graph - Document - PDFSEARCH.IO

First Page	Meta Content
	SIAM J. COMPUT. Vol. 42, No. 3, pp. 733–751 Add to Reading List Document Date: 2013-07-31 02:15:26 Open Document File Size: 371,47 KB Share Result on Facebook Currency pence / / / Facility Chinese University of Hong Kong / / IndustryTerm faster algorithm / faster algorithms / network coding solution / straightforward algorithm / random linear network / random linear coding algorithm / polynomial time deterministic algorithm / rectangular matrix multiplication algorithm / linear network / eﬃcient network / direct algorithm / rst search / eﬃcient algorithms / / NaturalFeature rank(Mt / deﬁne Mt / det(Mt / / Organization Chinese University of Hong Kong / Society for Industrial / / Person LAP CHI LAU / YEE CHEUNG / Ai / KAI MAN LEUNG / / Position head / second author / / ProvinceOrState Mississippi / / Technology polynomial time deterministic algorithm / Our algorithm / faster algorithm / rectangular matrix multiplication algorithm / resulting algorithm / eﬃcient algorithms / random linear coding algorithm / time algorithm / existing algorithms / straightforward algorithm / Tarjan algorithm / same algorithm / direct algorithm / / URL http / SocialTag Matching Planar graph Graph Graph coloring Matroid theory Network theory Edge coloring Path decomposition Graph theory Mathematics

SIAM J. COMPUT. Vol. 42, No. 3, pp. 733–751Add to Reading List