Embeddings in recursive combinatorial networks

Sajal K. Das; Aisheng Mao

doi:10.1007/3-540-56402-0_47

Embeddings in recursive combinatorial networks

Sajal K. Das
, Aisheng Mao

University of North Texas

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	Graph-Theoretic Concepts in Computer Science - 18th International Workshop, WG 1992, Proceedings
Editors	Ernst W. Mayr
Publisher	Springer Verlag
Pages	184-204
Number of pages	21
ISBN (Print)	9783540564027
DOIs	https://doi.org/10.1007/3-540-56402-0_47
State	Published - 1993
Externally published	Yes
Event	18th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1992 - Wiesbaden-Naurod, Germany Duration: Jun 18 1992 → Jun 20 1992

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	657 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	18th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1992
Country/Territory	Germany
City	Wiesbaden-Naurod
Period	6/18/92 → 6/20/92

ASJC Scopus Subject Areas

Theoretical Computer Science
General Computer Science

Keywords

Bipartite graphs
Combinatorial networks
Congestion-free routing
Embedding
Full binary trees
Hypercube
Interconnection networks
Mesh

Access to Document

10.1007/3-540-56402-0_47

Cite this

Das, S. K., & Mao, A. (1993). Embeddings in recursive combinatorial networks. In E. W. Mayr (Ed.), Graph-Theoretic Concepts in Computer Science - 18th International Workshop, WG 1992, Proceedings (pp. 184-204). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 657 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-56402-0_47

Embeddings in recursive combinatorial networks. / Das, Sajal K.; Mao, Aisheng.
Graph-Theoretic Concepts in Computer Science - 18th International Workshop, WG 1992, Proceedings. ed. / Ernst W. Mayr. Springer Verlag, 1993. p. 184-204 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 657 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Das, SK & Mao, A 1993, Embeddings in recursive combinatorial networks. in EW Mayr (ed.), Graph-Theoretic Concepts in Computer Science - 18th International Workshop, WG 1992, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 657 LNCS, Springer Verlag, pp. 184-204, 18th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1992, Wiesbaden-Naurod, Germany, 6/18/92. https://doi.org/10.1007/3-540-56402-0_47

Das SK, Mao A. Embeddings in recursive combinatorial networks. In Mayr EW, editor, Graph-Theoretic Concepts in Computer Science - 18th International Workshop, WG 1992, Proceedings. Springer Verlag. 1993. p. 184-204. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-56402-0_47

Das, Sajal K. ; Mao, Aisheng. / Embeddings in recursive combinatorial networks. Graph-Theoretic Concepts in Computer Science - 18th International Workshop, WG 1992, Proceedings. editor / Ernst W. Mayr. Springer Verlag, 1993. pp. 184-204 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{da08ed25c8c643cb9cb01c67840ecbc8,

title = "Embeddings in recursive combinatorial networks",

keywords = "Bipartite graphs, Combinatorial networks, Congestion-free routing, Embedding, Full binary trees, Hypercube, Interconnection networks, Mesh",

author = "Das, \{Sajal K.\} and Aisheng Mao",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1993.; 18th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1992 ; Conference date: 18-06-1992 Through 20-06-1992",

year = "1993",

doi = "10.1007/3-540-56402-0\_47",

language = "English",

isbn = "9783540564027",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "184--204",

editor = "Mayr, \{Ernst W.\}",

booktitle = "Graph-Theoretic Concepts in Computer Science - 18th International Workshop, WG 1992, Proceedings",

}

TY - GEN

T1 - Embeddings in recursive combinatorial networks

AU - Das, Sajal K.

AU - Mao, Aisheng

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1993.

PY - 1993

Y1 - 1993

KW - Bipartite graphs

KW - Combinatorial networks

KW - Congestion-free routing

KW - Embedding

KW - Full binary trees

KW - Hypercube

KW - Interconnection networks

KW - Mesh

UR - https://www.scopus.com/pages/publications/3142661131

UR - https://www.scopus.com/pages/publications/3142661131#tab=citedBy

U2 - 10.1007/3-540-56402-0_47

DO - 10.1007/3-540-56402-0_47

M3 - Conference contribution

AN - SCOPUS:3142661131

SN - 9783540564027

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 184

EP - 204

BT - Graph-Theoretic Concepts in Computer Science - 18th International Workshop, WG 1992, Proceedings

A2 - Mayr, Ernst W.

PB - Springer Verlag

T2 - 18th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1992

Y2 - 18 June 1992 through 20 June 1992

ER -

Embeddings in recursive combinatorial networks

Publication series

Conference

ASJC Scopus Subject Areas

Keywords

Access to Document

Other files and links

Fingerprint

Cite this