ALGORITHMIC COMPLEXITY OF FINDING CROSS-CYCLES IN FLAG COMPLEXES MICHAL ADAMASZEK AND JURAJ STACHO Abstract. A cross-cycle in a flag simplicial complex K is an induced subcomplex that is isomorphic to the boundary of a c - Cross-matching - Document - PDFSEARCH.IO

First Page	Meta Content
	ALGORITHMIC COMPLEXITY OF FINDING CROSS-CYCLES IN FLAG COMPLEXES MICHAL ADAMASZEK AND JURAJ STACHO Abstract. A cross-cycle in a flag simplicial complex K is an induced subcomplex that is isomorphic to the boundary of a c Add to Reading List Document Date: 2014-10-30 10:03:20 Open Document File Size: 387,92 KB Share Result on Facebook Company Let KG / / Facility Vietoris-Rips complex / / IndustryTerm exponential time algorithm / polynomial time algorithms / canonical solution / algorithmic applications / linear time algorithm / rooted canonical solution / polynomial time algorithm / canonical solutions / / Organization Centre for Discrete Mathematics / / Person MICHAL ADAMASZEK / JURAJ STACHO / / Position vp / / ProvinceOrState Georgia / / Technology main algorithm / exponential time algorithm / linear time algorithm / polynomial time algorithms / polynomial time algorithm / time algorithm / / SocialTag Induced path Matching Clique Dominating set Interval graph Algebraic topology Line graph Path decomposition Graph theory Chordal graph

ALGORITHMIC COMPLEXITY OF FINDING CROSS-CYCLES IN FLAG COMPLEXES MICHAL ADAMASZEK AND JURAJ STACHO Abstract. A cross-cycle in a flag simplicial complex K is an induced subcomplex that is isomorphic to the boundary of a cAdd to Reading List