FINDING OF A MINIMAL SKELETON OF A GRAPH

被引：0
|
作者：
ROSHCHIN, GB
机构：
来源：
ENGINEERING CYBERNETICS | 1978年 / 16卷 / 01期
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：97 / 101
页数：5
相关论文
共 50 条
  • [1] ALGORITHM FOR FINDING A MINIMAL EQUIVALENT GRAPH OF A DIGRAPH
    HSU, HT
    JOURNAL OF THE ACM, 1975, 22 (01) : 11 - 16
  • [2] Growing Like a Tree: Finding Trunks From Graph Skeleton Trees
    Huang, Zhongyu
    Wang, Yingheng
    Li, Chaozhuo
    He, Huiguang
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2024, 46 (05) : 2838 - 2851
  • [3] ALGORITHM FOR FINDING THE MINIMAL LENGTH HAMILTONIAN PATH IN A GRAPH.
    Mierlea, V.
    1600,
  • [4] Algorithm for Finding Minimal and Quaziminimal st-Cuts in Graph
    Grishkevich, Andrey
    IMAGE PROCESSING AND COMMUNICATIONS: TECHNIQUES, ALGORITHMS AND APPLICATIONS, 2020, 1062 : 65 - 72
  • [5] ALGORITHM FOR FINDING A MINIMAL EQUIVALENT GRAPH OF A STRONGLY CONNECTED DIGRAPH
    MARTELLO, S
    COMPUTING, 1979, 21 (03) : 183 - 194
  • [6] Graph-Based Minimal Path Tracking in the Skeleton of the Retinal Vascular Network
    Lupascu, Carmen Alina
    Tegolo, Domenico
    2012 25TH INTERNATIONAL SYMPOSIUM ON COMPUTER-BASED MEDICAL SYSTEMS (CBMS), 2012,
  • [7] EFFICIENT ALGORITHM FOR FINDING ALL MINIMAL EDGE CUTS OF A NONORIENTED GRAPH
    KARZANOV, AV
    TIMOFEEV, EA
    CYBERNETICS, 1986, 22 (02): : 156 - 162
  • [8] Finding a maximum minimal separator: Graph classes and fixed-parameter tractability
    Hanaka, Tesshu
    Kobayashi, Yasuaki
    Kobayashi, Yusuke
    Yagita, Tsuyoshi
    THEORETICAL COMPUTER SCIENCE, 2021, 865 : 131 - 140
  • [9] Chrisimos: A useful Proof-of-Work for finding Minimal Dominating Set of a graph
    Chatterjee, Diptendu
    Banerjee, Prabal
    Mazumdar, Subhra
    2023 IEEE 22ND INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS, TRUSTCOM, BIGDATASE, CSE, EUC, ISCI 2023, 2024, : 1332 - 1339
  • [10] FINDING MINIMAL CENTER-MEDIAN CONVEX COMBINATION (CENT-DIAN) OF A GRAPH
    HALPERN, J
    MANAGEMENT SCIENCE, 1978, 24 (05) : 535 - 544
12345