메뉴 건너뛰기




Volumn 3669, Issue , 2005, Pages 131-142

Finding shortest non-separating and non-contractible cycles for topologically embedded graphs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY;

EID: 27144444058     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_14     Document Type: Conference Paper
Times cited : (13)

References (21)
  • 2
    • 0032623455 scopus 로고    scopus 로고
    • Transforming curves on surfaces
    • Preliminary version in FOCS'95
    • T. K. Dey and S. Guha. Transforming curves on surfaces. J. Comput. Syst. Sci., 58:297-325, 1999. Preliminary version in FOCS'95.
    • (1999) J. Comput. Syst. Sci. , vol.58 , pp. 297-325
    • Dey, T.K.1    Guha, S.2
  • 3
    • 21844508783 scopus 로고
    • A new technique to compute polygonal schema for 2-manifolds with application to null-homotopy detection
    • T. K. Dey and H. Schipper. A new technique to compute polygonal schema for 2-manifolds with application to null-homotopy detection. Discrete Comput. Geom., 14:93-110, 1995.
    • (1995) Discrete Comput. Geom. , vol.14 , pp. 93-110
    • Dey, T.K.1    Schipper, H.2
  • 4
    • 84896796047 scopus 로고    scopus 로고
    • On-line algorithms for shortest path problems on planar digraphs
    • In WG'96
    • H. Djidjev. On-line algorithms for shortest path problems on planar digraphs. In WG'96, volume 1197 of LNCS, pages 151-165, 1997.
    • (1997) LNCS , vol.1197 , pp. 151-165
    • Djidjev, H.1
  • 6
    • 0036949155 scopus 로고    scopus 로고
    • Optimal system of loops on an orientable surface
    • To appear in Discrete Comput. Geom.
    • É. Colin de Verdière and F. Lazarus. Optimal system of loops on an orientable surface. In FOCS 2002, pages 627-636, 2002. To appear in Discrete Comput. Geom.
    • (2002) FOCS 2002 , pp. 627-636
    • De Verdière, É.C.1    Lazarus, F.2
  • 7
    • 33847333315 scopus 로고    scopus 로고
    • Optimal pants decompositions and shortest homotopic cycles on an orientable surface
    • GD 2003
    • É. Colin de Verdière and F. Lazarus. Optimal pants decompositions and shortest homotopic cycles on an orientable surface. In GD 2003, volume 2912 of LNCS, 2004.
    • (2004) LNCS , vol.2912
    • De Verdière, É.C.1    Lazarus, F.2
  • 8
    • 0038077457 scopus 로고    scopus 로고
    • Dynamic generators of topologically embedded graphs
    • D. Eppstein. Dynamic generators of topologically embedded graphs. In SODA 2003, pages 599-608, 2003.
    • (2003) SODA 2003 , pp. 599-608
    • Eppstein, D.1
  • 9
    • 1142300702 scopus 로고    scopus 로고
    • Optimally cutting a surface into a disk
    • Preliminary version in SoCG'02
    • J. Erickson and S. Har-Peled. Optimally cutting a surface into a disk. Discrete Comput. Geom., 31:37-59, 2004. Preliminary version in SoCG'02.
    • (2004) Discrete Comput. Geom. , vol.31 , pp. 37-59
    • Erickson, J.1    Har-Peled, S.2
  • 10
    • 20844459460 scopus 로고    scopus 로고
    • Greedy optimal homotopy and homology generators
    • J. Erickson and K. Whittlesey. Greedy optimal homotopy and homology generators. In SODA 2005, 2005.
    • (2005) SODA 2005
    • Erickson, J.1    Whittlesey, K.2
  • 11
    • 0035167358 scopus 로고    scopus 로고
    • Planar graphs, negative weight edges, shortest paths, and near linear time
    • J. Fakcharoenphol and S. Rao. Planar graphs, negative weight edges, shortest paths, and near linear time. In FOCS 2001, pages 232-242, 2001.
    • (2001) FOCS 2001 , pp. 232-242
    • Fakcharoenphol, J.1    Rao, S.2
  • 12
    • 0023384210 scopus 로고
    • Fibonacci heaps and their uses in improved network optimization algorithms
    • Preliminary version in FOCS'84
    • M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34:596-615, 1987. Preliminary version in FOCS'84.
    • (1987) J. ACM , vol.34 , pp. 596-615
    • Fredman, M.L.1    Tarjan, R.E.2
  • 15
    • 20744452901 scopus 로고    scopus 로고
    • Multiple-source shortest paths in planar graphs
    • P. N. Klein. Multiple-source shortest paths in planar graphs. In SODA 2005, 2005.
    • (2005) SODA 2005
    • Klein, P.N.1
  • 16
    • 0034825856 scopus 로고    scopus 로고
    • Computing a canonical polygonal schema of an orientable triangulated surface
    • F. Lazarus, M. Pocchiola, G. Vegter, and A. Verroust. Computing a canonical polygonal schema of an orientable triangulated surface. In SOCG 2001, pages 80-89, 2001.
    • (2001) SOCG 2001 , pp. 80-89
    • Lazarus, F.1    Pocchiola, M.2    Vegter, G.3    Verroust, A.4
  • 18
    • 0000500320 scopus 로고
    • Disjoint circuits of prescribed homotopies in a graph on a compact surface
    • A. Schrijver. Disjoint circuits of prescribed homotopies in a graph on a compact surface. J. Combin. Theory Ser. B, 51:127-159, 1991.
    • (1991) J. Combin. Theory Ser. B , vol.51 , pp. 127-159
    • Schrijver, A.1
  • 19
    • 27144534276 scopus 로고
    • Paths in graphs and curves on surfaces
    • First European Congress of Mathematics, Vol. II, Birkhäuser
    • A. Schrijver. Paths in graphs and curves on surfaces. In First European Congress of Mathematics, Vol. II, volume 120 of Progr. Math., pages 381-406. Birkhäuser, 1994.
    • (1994) Progr. Math. , vol.120 , pp. 381-406
    • Schrijver, A.1
  • 20
    • 38249019129 scopus 로고
    • Embeddings of graphs with no short noncontractible cycles
    • C. Thomassen. Embeddings of graphs with no short noncontractible cycles. J. Combin. Theory, Ser. B, 48:155-177, 1990.
    • (1990) J. Combin. Theory, Ser. B , vol.48 , pp. 155-177
    • Thomassen, C.1
  • 21
    • 0025054885 scopus 로고
    • Computational complexity of combinatorial surfaces
    • G. Vegter and C. K. Yap. Computational complexity of combinatorial surfaces. In SOCG 1990, pages 102-111, 1990.
    • (1990) SOCG 1990 , pp. 102-111
    • Vegter, G.1    Yap, C.K.2


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