✦ LIBER ✦

Optimal Function Computation in Directed and Undirected Graphs

✍ Scribed by Kowshik, H.; Kumar, P.R.

Book ID: 114643113
Publisher: IEEE
Year: 2012
Tongue: English
Weight: 307 KB
Volume: 58
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2012.2188883

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multi-Session Function Computation and M

Multi-Session Function Computation and Multicasting in Undirected Graphs

✍ Kannan, Sreeram; Viswanath, Pramod 📂 Article 📅 2013 🏛 IEEE 🌐 English ⚖ 560 KB

Finding All Spanning Trees of Directed a

Finding All Spanning Trees of Directed and Undirected Graphs

✍ Gabow, Harold N.; Myers, Eugene W. 📂 Article 📅 1978 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 876 KB

Efficient algorithms for finding minimum

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

✍ Harold N. Gabow; Zvi Galil; Thomas Spencer; Robert E. Tarjan 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 939 KB

Chromatic numbers of products of graphs:

Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function

✍ Claude Tardif; David Wehlau 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 61 KB

## Abstract Let __f__(__n__) = min{χ(__G__ × __H__) : __G__ and __H__ are __n__‐chromatic digraphs} and __g__(__n__) = min{χ(__G__ × __H__) : __G__ and __H__ are __n__‐chromatic graphs}. We prove that __f__ is bounded if and only if __g__ is bounded. © 2005 Wiley Periodicals, Inc. J Graph Theory

Efficient deterministic algorithms for f

Efficient deterministic algorithms for finding optimal cycle bases in undirected graphs

✍ Iuliano, Claudio 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 75 KB

Packing cuts in undirected graphs

✍ Alberto Caprara; Alessandro Panconesi; Romeo Rizzi 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB