• Reference Citation Analysis
  • v
  • v
  • Find an Article
Find an Article PDF (4598322)   Today's Articles (644)   Subscriber (49355)
For:  [Subscribe] [Scholar Register]
Number Cited by Other Article(s)
1
O(n2) algorithms for graph planarization. ACTA ACUST UNITED AC 2005. [DOI: 10.1007/3-540-50728-0_56] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register]
2
Bacci S, Parga N. Ultrametricity, frustration and the graph colouring problem. ACTA ACUST UNITED AC 1999. [DOI: 10.1088/0305-4470/22/15/018] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/12/2022]
3
Network analysis of genetic resources data: I. Geographical relationships. ACTA ACUST UNITED AC 1980. [DOI: 10.1016/0304-3746(80)90012-8] [Citation(s) in RCA: 10] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/24/2022]
4
Mulhall DJ. The representation of personal relationships: an automated system. ACTA ACUST UNITED AC 1977. [DOI: 10.1016/s0020-7373(77)80029-1] [Citation(s) in RCA: 8] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/21/2022]
5
Chua L, Li-Kuan Chen. On optimally sparse cycle and coboundary basis for a linear graph. ACTA ACUST UNITED AC 1973. [DOI: 10.1109/tct.1973.1083752] [Citation(s) in RCA: 18] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/07/2022]
6
Bruno J, Steiglitz K, Weinberg L. A new planarity test based on 3-connectivity. ACTA ACUST UNITED AC 1970. [DOI: 10.1109/tct.1970.1083101] [Citation(s) in RCA: 8] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/10/2022]
7
Danielson G. On finding the simple paths and circuits in a graph. ACTA ACUST UNITED AC 1968. [DOI: 10.1109/tct.1968.1082837] [Citation(s) in RCA: 40] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/09/2022]
8
Dunn W, Chan S. An Algorithm for Testing the Planarity of a Graph. ACTA ACUST UNITED AC 1968. [DOI: 10.1109/tct.1968.1082800] [Citation(s) in RCA: 6] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/08/2022]
PrevPage 1 of 1 1Next
© 2004-2024 Baishideng Publishing Group Inc. All rights reserved. 7041 Koll Center Parkway, Suite 160, Pleasanton, CA 94566, USA