×

Found 38 Documents (Results 1–38)

Shortest disjoint \(S\)-paths via weighted linear matroid parity. (English) Zbl 1398.05207

Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 63, 13 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI

Non-zero disjoint cycles in highly connected group labeled graphs. (English) Zbl 1200.05120

Raspaud, André (ed.) et al., 7th international colloquium on graph theory, Hyeres, France, September 12–16, 2005. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 22, 271-275 (2005).
MSC:  05C38 05C40 05C78
PDFBibTeX XMLCite
Full Text: DOI

Network models encoded by weighted tetrahedra. (English) Zbl 0843.05066

Alavi, Y. (ed.) et al., Graph theory, combinatorics, algorithms and applications. Vol. 1. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 289-300 (1995).
MSC:  05C38 05C78 05B45
PDFBibTeX XMLCite

Graph substitution operations and the dynamics of collateralhierarchical graphs. II. (English. Russian original) Zbl 0478.90039

Autom. Remote Control 42, 357-363 (1981); translation from Avtom. Telemekh. 1981, No. 3, 104-111 (1981).
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software