✦ LIBER ✦

Semirings and Tree-to-Graph-to-Tree Transductions

✍ Scribed by Frank Drewes

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 515 KB
Volume: 2
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80184-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bideterminants, arborescences and extens

Bideterminants, arborescences and extension of the Matrix-Tree theorem to semirings

✍ M. Minoux 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 394 KB

The Matrix-Tree Theorem is a well-known combinatorial result relating the value of the minors of a certain square matrix to the sum of the weights of the arborescences (= rooted directed trees) in the associated graph. We prove an extension of this result to algebraic structures much more general th

A generalization of the all minors tree

A generalization of the all minors tree theorem to semirings

✍ M. Minoux 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 616 KB

The 'All Minors Matrix Tree Theorem' (Chen, Applied Graph Theory, Graphs and Electrical Networks, North-Holland, Amsterdam, 1976; Chaiken, SIAM J. Algebraic Discrete Math. 3 (3) (1982) 319-329) is an extension of the well-known 'Matrix Tree Theorem' (Tutte, Proc. Cambridge Philos. Sot. 44 (1948) 463

Addendum to “trees in random graphs”

✍ P Erdös; Z Palka 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 30 KB

The aim of this addendum is to explain more precisely the second part of the proof of Theorem 1 from our paper [1]. We need to show that a.e. graph G e~J(n,p) contains a maximal induced tree of order less than (l+e)X (log n)/(log d). The second moment method used in our Lemma shows in fact that

Beyond fault trees to fault graphs

✍ H.P. Alesso; P. Prassinos; C.F. Smith 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 539 KB

A decision tree approach to graph and su

A decision tree approach to graph and subgraph isomorphism detection

✍ B.T. Messmer; H. Bunke 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 577 KB

Tree-decompositions, tree-representabili

Tree-decompositions, tree-representability and chordal graphs

✍ Reinhard Diestel 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 427 KB

The following assertions are shown to be equivalent, for any countable graph G: (1) G can be represented as the intersection graph of a family of subtrees of a tree; (2) G admits a tree-decomposition (Robertson/Seymour) into primes; (3) G is chordal, and G admits a simpkial tree-decomposition (Halin