نتایج جستجو برای: 3 way v

تعداد نتایج: 2401186  

Journal: :The Journal of The Institute of Image Information and Television Engineers 2014

Journal: :Oper. Res. Lett. 2015
Sina Dehghani MohammadAmin Fazli Jafar Habibi Sadra Yazdanbod

In this paper, we consider the following problem: given an undirected graph G = (V , E) and an integer k, find I ⊆ V 2 with |I| ≤ k in such a way that G = (V , E ∪ I) has the maximum number of triangles (a cycle of length 3). We first prove that this problem is NP-hard and then give an approximation algorithm for it. © 2015 Elsevier B.V. All rights reserved.

Journal: :Revista da Faculdade de Odontologia - UPF 2018

Journal: :Journal of Graph Theory 2003
Zhi-Hong Chen Hong-Jian Lai Xiangwen Li Deying Li Jingzhong Mao

In this paper, we show that if G is a 3-edge-connected graph with S V ðGÞ and jSj 12, then eitherG has an Eulerian subgraphH such that S V ðHÞ, or G can be contracted to the Petersen graph in such a way that the preimage of each vertex of the Petersen graph contains at least one vertex in S. If G is a 3-edge-connected planar graph, then for any jSj 23, G has an Eulerian subgraph H such that S V...

Journal: :Revista da Faculdade de Odontologia - UPF 2020

Journal: :Revista Portal: Saúde e Sociedade 2018

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید