نتایج جستجو برای: maximum output cut off grade

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

2017
Xiao-Yi Wang Yan-Feng Zhao Ying Liu Yi-Kun Yang Ning Wu

The objective of this study was to assess the prognostic value of metabolic tumor burden measured by positron emission tomography/computed tomography (PET/CT) in patients with stage I lung adenocarcinoma.We reviewed 127 consecutive patients with pathologically proven stage I lung adenocarcinoma who underwent pretreatment [18F]FDG PET/CT scans in our hospital from 2005 June to 2012 June. The max...

Journal: :Discrete Mathematics 2001
Vincent Barré Jean-Luc Fouquet

Let G be a minimal imperfect P 5-free graph (i.e. a minimal imperfect graph not containing a path on 5 vertices as induced subgraph) and let S be a minimal cutset of G. In this paper we study several properties of such cutsets, in particular we prove that the subgraph induced by S is connected, contains a P 4 , cannot induce a bipartite subgraph of G .... As a by-product we also give a structur...

Journal: :Journal of the Southern African Institute of Mining and Metallurgy 2016

2012
Abbaszadeh-Ahranjani Shabnam Kashani Homa Mohajeri-Tehrani Mohammad Reza Larijani Bagher Forouzanfar Mohammad Hossein Afshani Hamidreza

INTRODUCTION The cut-off points of waist circumference and body mass index (BMI) are varied according to different races. There is a dearth of information on these indices especially in Iranian adults. We sought to estimate the cut-off points of waist circumference and BMI for detecting diabetes, hypercholesterolemia, and hypertension. MATERIAL AND METHODS The data were gathered by the First ...

Journal: :Discrete Applied Mathematics 2009
Xuding Zhu

A graph is subcubic if its maximum degree is at most 3. The bipartite density of a graph G is defined as b(G) = max{|E(B)|/|E(G)| : B is a bipartite subgraph of G}. It was conjectured by Bondy and Locke that if G is a triangle-free subcubic graph, then b(G) ≥ 45 and equality holds only if G is in a list of seven small graphs. The conjecture has been confirmed recently by Xu and Yu. This note gi...

Journal: :Oper. Res. Lett. 2010
Laura Galli Adam N. Letchford

We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes. We then show how these descriptions were used to compute the integrality ratio of various relaxations of the max-cut problem, again for up to eight nodes.

Journal: :Journal of the Southern African Institute of Mining and Metallurgy 2019

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

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