×

Found 13 Documents (Results 1–13)

Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs. (English) Zbl 1406.05104

Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 11th annual conference, TAMC 2014, Chennai, India, April 11–13, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-06088-0/pbk). Lecture Notes in Computer Science 8402, 216-228 (2014).
PDFBibTeX XMLCite
Full Text: DOI

Bipartite permutation graphs are reconstructible. (English) Zbl 1258.05082

Wu, Weili (ed.) et al., Combinatorial optimization and applications. 4th international conference, COCOA 2010, Kailua-Kona, HI, USA, December 18–20, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-17460-5/pbk). Lecture Notes in Computer Science 6509, 362-373 (2010).
MSC:  05C60 05A05
PDFBibTeX XMLCite
Full Text: DOI

Reconstruction algorithm for permutation graphs. (English) Zbl 1274.05451

Rahman, Md. Saidur (ed.) et al., WALCOM: Algorithms and computation. 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10–12, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-11439-7/pbk). Lecture Notes in Computer Science 5942, 125-135 (2010).
MSC:  05C85 05C60
PDFBibTeX XMLCite
Full Text: DOI

Reconstruction of interval graphs. (English) Zbl 1248.05125

Ngo, Hung Q. (ed.), Computing and combinatorics. 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13–15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02881-6/pbk). Lecture Notes in Computer Science 5609, 106-115 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field