SCOPUS 정보 검색 플랫폼

Volumn 26, Issue 5, 2005, Pages 585-592

The lattice dimension of a graph

Author keywords

[No Author keywords available]

Indexed keywords

EID: 13944259485 PISSN: 01956698 EISSN: None Source Type: Journal
DOI: 10.1016/j.ejc.2004.05.001 Document Type: Article

Times cited : (49)

References (16)

1
- 0011364404
- 2logn) time
- 2logn) time Math. Systems Theory 28 1995 387-395
- (1995) Math. Systems Theory , vol.28 , pp. 387-395
- Aurenhammer, F.¹ Hagauer, J.²

2
- 0039639040
- Embedding topological median algebras in product of dendrons
- Bandelt H.-J. van de Vel M. Embedding topological median algebras in product of dendrons Proc. London Math. Soc. 58 3 1989 439-453
- (1989) Proc. London Math. Soc. , vol.58 , Issue.3 , pp. 439-453
- Bandelt, H.-J.¹ van de Vel, M.²

3
- 84968911264
- Center and diameter problems in plane triangulations and quadrangulations
- Chepoi V. Dragan F. Vaxès Y. Center and diameter problems in plane triangulations and quadrangulations Proc. 13th ACM-SIAM Symp. Discrete Algorithms 2002 pp 346-355
- (2002) Proc. 13th ACM-SIAM Symp. Discrete Algorithms , pp. 346-355
- Chepoi, V.¹ Dragan, F.² Vaxès, Y.³

4
- 33749306854
- Distance preserving subgraphs of hypercubes
- Djokovic D.Z. Distance preserving subgraphs of hypercubes J. Combin. Theory Ser. B 14 1973 263-267
- (1973) J. Combin. Theory Ser. B , vol.14 , pp. 263-267
- Djokovic, D.Z.¹

5
- 34047267637
- A canonical decomposition theory for metrics on a finite set
- Dress A. A canonical decomposition theory for metrics on a finite set Adv. Math. 92 1992 47-105
- (1992) Adv. Math. , vol.92 , pp. 47-105
- Dress, A.¹

6
- 0000927535
- Paths, trees, and flowers
- Edmonds J. Paths, trees, and flowers Canad. J. Math. 17 1965 449-467
- (1965) Canad. J. Math. , vol.17 , pp. 449-467
- Edmonds, J.¹

8
- 84867949925
- Media theory
- Falmagne J.-C. Ovchinnikov S. Media theory Discrete Appl. Math. 121 1-3 2002 103-118
- (2002) Discrete Appl. Math. , vol.121 , Issue.1-3 , pp. 103-118
- Falmagne, J.-C.¹ Ovchinnikov, S.²

9
- 0037845672
- Manhattan trees
- Hadlock F. Hoffman F. Manhattan trees Util. Math. 13 1978 55-67
- (1978) Util. Math. , vol.13 , pp. 55-67
- Hadlock, F.¹ Hoffman, F.²

10
- 0040748193
- On the complexity of recognizing Hamming graphs and related classes of graphs
- Imrich W. Klavžar S. On the complexity of recognizing Hamming graphs and related classes of graphs European J. Combin. 17 1996 209-221
- (1996) European J. Combin. , vol.17 , pp. 209-221
- Imrich, W.¹ Klavžar, S.²

14
- 85064850083
- An O(√VE) algorithm for finding maximum matching in general graphs
- Micali S. Vazirani V.V. An O(√VE) algorithm for finding maximum matching in general graphs Proc. 21st Annu. IEEE Symp. on Foundations of Computer Science 1980 pp 17-27
- (1980) Proc. 21st Annu. IEEE Symp. on Foundations of Computer Science , pp. 17-27
- Micali, S.¹ Vazirani, V.V.²

16
- 0021372972
- Isometric embeddings in products of complete graphs
- P. Winkler, Isometric embeddings in products of complete graphs, Discrete Appl. Math. 7 (1984) 221-225
- (1984) Discrete Appl. Math. , vol.7 , pp. 221-225
- Winkler, P.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.