×

Found 9 Documents (Results 1–9)

Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs. (English) Zbl 07770289

Lin, Chun-Cheng (ed.) et al., WALCOM: algorithms and computation. 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13973, 151-163 (2023).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Path cover problems with length cost. (English) Zbl 07556587

Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 396-408 (2022).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Random generation and enumeration of proper interval graphs. (English) Zbl 1211.68291

Das, Sandip (ed.) et al., WALCOM: Algorithms and computation. Third international workshop, WALCOM 2009, Kolkata, India, February 18–20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00201-4/pbk). Lecture Notes in Computer Science 5431, 177-189 (2009).
MSC:  68R10 05C30 05C85
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field