• Title/Summary/Keyword: Independent set

Search Result 1,257, Processing Time 0.024 seconds

The Number of Maximal Independent sets of the Graph with joining Moon-Moser Graph and Complete Graph (Moon-Moser 그래프와 완전그래프를 결합한 그래프의 극대독립집합의 개수)

  • Chung, S.J.;Lee, C.S.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.20 no.4
    • /
    • pp.65-72
    • /
    • 1994
  • An independent set of nodes is a set of nodes no two of which are joined by an edge. An independent set is called maximal if no more nodes can be added to the set without destroying its independence. The greatest number of maximal independent set is the maximum possible number of maximal independent set of a graph. We consider the greatest number of maximal independent set in connected graphs with fixed numbers of edges and nodes. For arbitrary number of nodes with a certain class of number of edges, we present the connected graphs with the greatest number of maximal independent set. For a given class of number of edges, the structure of graphs with the greatest number of maximal independent set is that the two components are completely joined; one consists of disjoint triangles as many as possible and the other is the complete graph with remaining nodes.

  • PDF

INDEPENDENT TRANSVERSAL DOMINATION NUMBER IN COMPLEMENTARY PRISMS

  • Aytac, Aysun;Erkal, Cem
    • Honam Mathematical Journal
    • /
    • v.43 no.1
    • /
    • pp.17-25
    • /
    • 2021
  • A set D ⊆ V (G) is an independent transversal dominating set of G if D is a dominating set and also intersects every maximum independent set in G. The minimum cardinality of such a set is equal to the transversal domination number, denoted by ��it(G). This paper is devoted to the computation of the independent transversal domination number of some complementary prism.

An Efficient Multibody Dynamic Algorithm Using Independent Coordinates Set and Modified Velocity Transformation Method (수정된 속도변환기법과 독립좌표를 사용한 효율적인 다물체 동역학 알고리즘)

  • Kang, Sheen-Gil;Yoon, Yong-San
    • Proceedings of the KSME Conference
    • /
    • 2001.06b
    • /
    • pp.488-494
    • /
    • 2001
  • Many literatures, so far, have concentrated on approaches employing dependent coordinates set resulting in computational burden of constraint forces, which is needless in many cases. Some researchers developed methods to remove or calculate it efficiently. But systematic generation of the motion equation using independent coordinates set by Kane's equation is possible for any closed loop system. Independent velocity transformation method builds the smallest size of motion equation, but needs practically more complicated code implementation. In this study, dependent velocity matrix is systematically transformed into independent one using dependent-independent transformation matrix of each body group, and then motion equation free of constraint force is constructed. This method is compared with the other approach by counting the number of multiplications for car model with 15 d.o.f..

  • PDF

AN EFFICIENT PRAM ALGORITHM FOR MAXIMUM-WEIGHT INDEPENDENT SET ON PERMUTATION GRAPHS

  • SAHA ANITA;PAL MADHUMANGAL;PAL TAPAN K.
    • Journal of applied mathematics & informatics
    • /
    • v.19 no.1_2
    • /
    • pp.77-92
    • /
    • 2005
  • An efficient parallel algorithm is presented to find a maximum weight independent set of a permutation graph which takes O(log n) time using O($n^2$/ log n) processors on an EREW PRAM, provided the graph has at most O(n) maximal independent sets. The best known parallel algorithm takes O($log^2n$) time and O($n^3/log\;n$) processors on a CREW PRAM.

Distributed Algorithm for Maximal Weighted Independent Set Problem in Wireless Network (무선통신망의 최대 가중치 독립집합 문제에 관한 분산형 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.5
    • /
    • pp.73-78
    • /
    • 2019
  • This paper proposes polynomial-time rule for maximum weighted independent set(MWIS) problem that is well known NP-hard. The well known distributed algorithm selects the maximum weighted node as a element of independent set in a local. But the merged independent nodes with less weighted nodes have more weights than maximum weighted node are frequently occur. In this case, existing algorithm fails to get the optimal solution. To deal with these problems, this paper constructs maximum weighted independent set in local area. Application result of proposed algorithm to various networks, this algorithm can be get the optimal solution that fail to existing algorithm.

A Study of Flow Characteristics in Pressure Independent Control Valve for Hydronic System (냉난방수배관시스템용 차압독립형 유량제어밸브의 유동특성 연구)

  • Min, Joon-Ki;Won, Bo-Young;Jeong, Shin-Kyu
    • Journal of the Korean Society for Geothermal and Hydrothermal Energy
    • /
    • v.13 no.3
    • /
    • pp.9-15
    • /
    • 2017
  • In this study, set values of PICV(Pressure Independent Control Valve) were simulated according to the pressure distribution and velocity. The higher the set value and the open rate, as the lower the pressure in the neck. On the contrary, the lower the set value and open rate, as the higher the pressure in the neck. When the set value was small, the pressure was distributed sufficiently and confirmed that the pressure was generated by the VOF, confirming that it could generate a vapor pressure. When the set value 100 %, the lower corn open rate of the differential pressure was 46 % to 29 %, set value 100 % was 29 % to 19 %, and set value 6 % was 12 % to 6 % for the lower corn open rate percentile, it was limited to within 50 %. Thus, the results of this study on the correlation between open rate and differential pressure of the set value of the PICV will be beneficial to improve performance of flow control valves and contribute to their efficient operation used for a hydronic system.

An Ant Colony Optimization Approach for the Maximum Independent Set Problem (개미 군집 최적화 기법을 활용한 최대 독립 마디 문제에 관한 해법)

  • Choi, Hwayong;Ahn, Namsu;Park, Sungsoo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.33 no.4
    • /
    • pp.447-456
    • /
    • 2007
  • The ant colony optimization (ACO) is a probabilistic Meta-heuristic algorithm which has been developed in recent years. Originally ACO was used for solving the well-known Traveling Salesperson Problem. More recently, ACO has been used to solve many difficult problems. In this paper, we develop an ant colony optimization method to solve the maximum independent set problem, which is known to be NP-hard. In this paper, we suggest a new method for local information of ACO. Parameters of the ACO algorithm are tuned by evolutionary operations which have been used in forecasting and time series analysis. To show the performance of the ACO algorithm, the set of instances from discrete mathematics and computer science (DIMACS)benchmark graphs are tested, and computational results are compared with a previously developed ACO algorithm and other heuristic algorithms.

Text-independent Speaker Identification by Bagging VQ Classifier

  • Kyung, Youn-Jeong;Park, Bong-Dae;Lee, Hwang-Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.20 no.2E
    • /
    • pp.17-24
    • /
    • 2001
  • In this paper, we propose the bootstrap and aggregating (bagging) vector quantization (VQ) classifier to improve the performance of the text-independent speaker recognition system. This method generates multiple training data sets by resampling the original training data set, constructs the corresponding VQ classifiers, and then integrates the multiple VQ classifiers into a single classifier by voting. The bagging method has been proven to greatly improve the performance of unstable classifiers. Through two different experiments, this paper shows that the VQ classifier is unstable. In one of these experiments, the bias and variance of a VQ classifier are computed with a waveform database. The variance of the VQ classifier is compared with that of the classification and regression tree (CART) classifier[1]. The variance of the VQ classifier is shown to be as large as that of the CART classifier. The other experiment involves speaker recognition. The speaker recognition rates vary significantly by the minor changes in the training data set. The speaker recognition experiments involving a closed set, text-independent and speaker identification are performed with the TIMIT database to compare the performance of the bagging VQ classifier with that of the conventional VQ classifier. The bagging VQ classifier yields improved performance over the conventional VQ classifier. It also outperforms the conventional VQ classifier in small training data set problems.

  • PDF