×

Found 21 Documents (Results 1–21)

Induced acyclic subgraphs in random digraphs: improved bounds. (English) Zbl 1355.05224

Drmota, Michael (ed.) et al., Proceeding of the 21st international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA’10), Vienna, Austria, June 28 – July 2, 2010. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 159-174 (2010).
MSC:  05C80 05C20
PDFBibTeX XMLCite
Full Text: Link

An alternate approach to compute the reliability of a computer communication network using binary decision diagrams. (English) Zbl 1213.68138

Ranka, Sanjay (ed.) et al., Contemporary computing. Third international conference, IC3 2010, Noida, India, August 9–11, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-14833-0/pbk; 978-3-642-14834-7/ebook). Communications in Computer and Information Science 94, 160-170 (2010).
MSC:  68M15 68M10
PDFBibTeX XMLCite
Full Text: DOI

An algorithm to find a perfect map for graphoid structures. (English) Zbl 1213.68614

Hüllermeier, Eyke (ed.) et al., Information processing and management of uncertainty in knowledge-based systems. Theory and methods. 13th international conference, IPMU 2010, Dortmund, Germany, June 28–July 2, 2010. Proceedings. Part I. Berlin: Springer (ISBN 978-3-642-14054-9/pbk; 978-3-642-14055-6/ebook). Communications in Computer and Information Science 80, 1-10 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Largest induced acyclic tournament in random digraphs: a 2-point concentration. (English) Zbl 1283.05248

López-Ortiz, Alejandro (ed.), LATIN 2010: Theoretical informatics. 9th Latin American symposium, Oaxaca, Mexico, April 19–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12199-9/pbk). Lecture Notes in Computer Science 6034, 627-637 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 3

Main Field

all top 3

Software