×

Found 285 Documents (Results 1–100)

100
MathJax

Labelled port graph – a formal structure for models and computations. (English) Zbl 1433.68095

Alves, Sandra (ed.) et al., Selected papers of the 12th workshop on logical and semantic frameworks, with applications (LSFA 2017), Brasilia, Brazil, September 23–24, 2017. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 338, 3-21 (2018).
MSC:  68N30 68Q42
PDF BibTeX XML Cite
Full Text: DOI

The language of self-avoiding walks. Connective constants of quasi-transitive graphs. (English) Zbl 1407.05002

BestMasters. Wiesbaden: Springer Spektrum (Master Thesis) (ISBN 978-3-658-24763-8/pbk; 978-3-658-24764-5/ebook). viii, 65 p. (2018).
PDF BibTeX XML Cite
Full Text: DOI

Scaling limit of random \(k\)-trees. (English) Zbl 1433.05278

Fill, James Allen (ed.) et al., Proceedings of the 13th workshop on analytic algorithmics and combinatorics, ANALCO ’16, Arlington, VA, USA, January 11, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 56-65 (2016).
PDF BibTeX XML Cite
Full Text: DOI

Jerboa: a graph transformation library for topology-based geometric modeling. (English) Zbl 1423.68537

Giese, Holger (ed.) et al., Graph transformation. 7th international conference, ICGT 2014, held as part of STAF 2014, York, UK, July 22–24, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8571, 269-284 (2014).
MSC:  68U05 68Q42 68U35
PDF BibTeX XML Cite
Full Text: DOI

Relatively bridge-addable classes of graphs. (English) Zbl 1406.05097

Pardo, Alberto (ed.) et al., LATIN 2014: theoretical informatics. 11th Latin American symposium, Montevideo, Uruguay, March 31 – April 4, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54422-4/pbk). Lecture Notes in Computer Science 8392, 391-398 (2014).
MSC:  05C80 05C78
PDF BibTeX XML Cite
Full Text: DOI

Asymptotic properties of some minor-closed classes of graphs. (English) Zbl 1294.05136

Proceedings of the 25th international conference on formal power series and algebraic combinatorics, FPSAC 2013, Paris, France, June 24–28, 2013. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 599-610, electronic only (2013).
PDF BibTeX XML Cite
Full Text: Link

Labelled stratified graphs can generate formal languages. (English) Zbl 1335.68125

Mastorakis, Nikos (ed.) et al., Applied mathematics and informatics. European conference for the applied mathematics and informatics, Vouliagmeni, Athens, Greece, December 29–31, 2010. Athens: WSEAS Press (ISBN 978-960-474-260-8/hbk; 978-960-474-266-0/cd-rom). Applied Mathematics and Informatics, 184-189 (2010).
MSC:  68Q45 05C90
PDF BibTeX XML Cite

Labelled transitions for mobile ambients (as synthesized via a graphical encoding). (English) Zbl 1291.68281

Hildebrandt, Thomas (ed.) et al., Proceedings of the 15th international workshop on expressiveness in concurrency (EXPRESS 2008), Toronto, Canada, August 23, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 242, No. 1, 73-98 (2009).
MSC:  68Q85 68R10
PDF BibTeX XML Cite
Full Text: DOI

Embedded trees and the support of the ISE. (English) Zbl 1267.05064

Fiala, Jiří (ed.) et al., Combinatorial algorithms. 20th international workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28–July 2, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-10216-5/pbk). Lecture Notes in Computer Science 5874, 194-205 (2009).
MSC:  05C05 05A15 05C80
PDF BibTeX XML Cite
Full Text: DOI Link

Are even maps on surfaces likely to be bipartite? (English) Zbl 1355.05093

Fifth colloquium on mathematics and computer science. Lectures from the colloquium, Blaubeuren, Germany, September 22–26, 2008. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science Proceedings AI, 363-374 (2008).
PDF BibTeX XML Cite
Full Text: Link

Graphs and path equilibria. (English) Zbl 1143.90394

Fleischer, Rudolf (ed.) et al., Algorithmic aspects in information and management. 4th international conference, AAIM 2008, Shanghai, China, June 23–25, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-68865-5/pbk). Lecture Notes in Computer Science 5034, 247-258 (2008).
MSC:  90C35
PDF BibTeX XML Cite
Full Text: DOI Link

\(Q\)-trees – efficient retrieval of graphs by means of structure invariants. (\(Q\)-Bäume – effizientes Retrieval von Graphen mit Hilfe von Strukturinvarianten.) (German) Zbl 1151.68010

Berichte aus der Informatik. Aachen: Shaker Verlag; Chemnitz: Univ. Chemnitz, Fakultät für Informatik (ISBN 978-3-8322-7166-4/pbk). viii, 218 p. (2008).
PDF BibTeX XML Cite
Full Text: Link

Heuristic approaches for the minimum labelling Hamiltonian cycle problem. (English) Zbl 1134.05322

Faigle, U. (ed.) et al., CTW2006. Cologne-Twente Workshop on graphs and combinatorial optimization, Lambrecht, Germany, June 5–9, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 25, 131-138 (2006).
MSC:  05C38 05C45
PDF BibTeX XML Cite
Full Text: DOI

An extremal problem on trees and database theory. (English) Zbl 1192.05076

Felsner, Stefan (ed.), 2005 European conference on combinatorics, graph theory and applications (EuroComb ’05). Extended abstracts from the conference, Technische Universität Berlin, Berlin, Germany, September 5–9, 2005. Paris: Maison de l’Informatique et des Mathématiques Discrètes (MIMD). Discrete Mathematics & Theoretical Computer Science. Proceedings. AE, 293-298, electronic only (2005).
PDF BibTeX XML Cite
Full Text: Link

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software