✦ LIBER ✦

Succinct representation of general unlabeled graphs

✍ Scribed by Moni Naor

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 328 KB
Volume: 28
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90011-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the succinct representation of graphs

✍ György Turán 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 371 KB

Succinct representation of regular langu

Succinct representation of regular languages by boolean automata

✍ Ernst Leiss 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 346 KB

Boolean automata are a generalization of finite automata in the sense that the 'next state'i i.e. the result of the transition function given a state and a letter, is not just a single state (deterministic automata) or a union of states (nondeterministic automata) but a boolean function of states. B

The random selection of unlabeled graphs

✍ John D Dixon; Herbert S Wilf 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 447 KB

Succinct definitions in the first order

Succinct definitions in the first order theory of graphs

✍ Oleg Pikhurko; Joel Spencer; Oleg Verbitsky 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 471 KB

The chromatic polynomial of an unlabeled

The chromatic polynomial of an unlabeled graph

✍ P Hanlon 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 615 KB

Representation of graphs

✍ Alon Itai; Michael Rodeh 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 254 KB