✦ LIBER ✦

On the edge forwarding index problem for small graphs

✍ Scribed by Abdelmadjid Bouabdallah; Dominique Sotteau

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 540 KB
Volume: 23
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230230406

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The edge-forwarding index of orbital reg

The edge-forwarding index of orbital regular graphs

✍ Patrick Solé 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 351 KB

We define a graph as orbital regular if there is a subgroup of its automorphism group that acts regularly on the set of edges of the graph as well as on all its orbits of ordered pairs of distinct vertices of the graph. For these graphs there is an explicit formula for the edgeforwarding index, an i

On the restricted forwarding index probl

On the restricted forwarding index problem in communication networks

✍ Min Xu; Xujin Chen; Xiaodong Hu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 319 KB

In a communication network it is desirable that all pairs of nodes can exchange messages at the same time. But under the capacity constraints on nodes or links this desired property may not be satisfied; only some node pairs can communicate with each other while the rest have to be blocked. A natura

NP completeness of the edge precoloring

NP completeness of the edge precoloring extension problem on bipartite graphs

✍ Jiří Fiala 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 63 KB 👁 1 views

## Abstract We show that the following problem is __NP__ complete: Let __G__ be a cubic bipartite graph and __f__ be a precoloring of a subset of edges of __G__ using at most three colors. Can __f__ be extended to a proper edge 3‐coloring of the entire graph __G__? This result provides a natural co

The edge Hamiltonian path problem is NP-

The edge Hamiltonian path problem is NP-complete for bipartite graphs

✍ Ten-Hwang Lai; Shu-Shang Wei 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 508 KB

On the Ramsey Problem for Multicolor Bip

On the Ramsey Problem for Multicolor Bipartite Graphs

✍ W.A Carnielli; E.L Monte Carmelo 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 85 KB

Given i, j positive integers, let K denote a bipartite complete graph and let i, j ## Ž . R m, n be the smallest integer a such that for any r-coloring of the edges of K r a, a one can always find a monochromatic subgraph isomorphic to K . In other m, n Ž . Ä 4 words, if a G R m, n then every mat

Clustering analysis for graphs with mult

Clustering analysis for graphs with multiweighted edges: A unified approach to the threshold problem

✍ Goetschel, Roy 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 494 KB 👁 2 views

Multivalent relations, inferred as relationships with an added dimension of discernment, are realized as weighted graphs with multivalued edges. A unified treatment of the threshold problem is discussed and a reliability measure is produced to judge various partitions. 'R+ represents the non-negati