×

Found 31 Documents (Results 1–31)

Recognizing hyperelliptic graphs in polynomial time. (English) Zbl 1517.68276

Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 44th international workshop, WG 2018, Cottbus, Germany, June 27–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11159, 52-64 (2018).
MSC:  68R10 05C85 68Q25

Random walks, electric networks and the transience class problem of sandpiles. (English) Zbl 1423.05157

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1593-1611 (2012).

The complexity of three-dimensional critical avalanches. (English) Zbl 1306.68045

Bandini, Stefania (ed.) et al., Cellular automata. 9th international conference on cellular automata for research and industry, ACRI 2010, Ascoli Piceno, Italy, September 21–24, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15978-7/pbk). Lecture Notes in Computer Science 6350, 153-162 (2010).
MSC:  68Q25 68Q80 76T25
Full Text: DOI

Filter Results by …

Access

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software