Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
Algorithmic complexity of finding cross-cycles in flag complexes Michal Adamaszek, Juraj Stacho University of Warwick, UK Centre for Discrete Mathematics and its Applications (DIMAP)
Add to Reading List
Document Date: 2015-03-23 03:34:03
Open Document
File Size: 221,18 KB
Share Result on Facebook
Company
Hk /
/
Event
FDA Phase /
/
Facility
Juraj Stacho University of Warwick /
/
IndustryTerm
homology /
/
Organization
University of Warwick /
UK Centre for Discrete Mathematics /
/
Person
Juraj Stacho Cross-cycles /
Michal Adamaszek /
Juraj Stacho /
Juraj Stacho Ind /
/
Product
H1 /
/
SocialTag
Algebraic topology
Chordal graph
Clique complex
Graph
Vietoris–Rips complex
CW complex
Induced path
Maximal independent set
Simplicial complex
Graph theory
Algorithmic complexity of finding cross-cycles in flag complexes Michal Adamaszek, Juraj Stacho University of Warwick, UK Centre for Discrete Mathematics and its Applications (DIMAP)