×

Found 23 Documents (Results 1–23)

Generalized distance domination problems and their complexity on graphs of bounded mim-width. (English) Zbl 1520.05073

Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 6, 14 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Strong non split \(r\)-domination number of a graph. (English) Zbl 1267.05197

Balakrishnan, R. (ed.) et al., International conference on graph theory and its applications. Papers from the conference, Coimbatore, India, December 11–13, 2008. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 33, 51-57 (2009).
MSC:  05C69
PDFBibTeX XMLCite
Full Text: DOI

Approximating the spanning \(k\)-tree forest problem. (English) Zbl 1248.68562

Deng, Xiaotie (ed.) et al., Frontiers in algorithmics. Third international workshop, FAW 2009, Hefei, China, June 20–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02269-2/pbk). Lecture Notes in Computer Science 5598, 293-301 (2009).
MSC:  68W25 68R10
PDFBibTeX XMLCite
Full Text: DOI

On the universality of small-world graphs. (English) Zbl 1171.05435

Nešetřil, Jaroslav (ed.) et al., Comb01—Euroconference on combinatorics, graph theory and applications. Extended abstracts from the conference, Barcelona, Spain, September 12–15, 2001. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 10, 84-87 (2001).
MSC:  05C99
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

Software