Results 261 to 270 of about 16,341,714 (282)
Some of the next articles are maybe not open access.

k-factors in regular graphs

Acta Mathematica Sinica, English Series, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shiu, Wai Chee, Liu, Guizhen
openaire   +2 more sources

K-Factor Theory

Proceedings of Fall Meeting of the Society of Petroleum Engineers of AIME, 1971
Abstract It is the purpose of this paper to outline the present state of art for determining K-factors, in particular those which apply to volatile oil and condensate fluids. Equations are presented that can be used to select K-factors for volatile fluids through convergence pressure calculations.
C.S. Kaliappan, Allen Rowe Jr.
openaire   +2 more sources

The K Factor

English Today, 2003
Most disciplines seem to have their “K factors”, though linguistics has so far been an exception. Now a language-related K factor has surfaced, kindled by Italian text messages and the influence of English.
openaire   +1 more source

K-Factors and Hamilton Cycles in Graphs

Acta Mathematica Sinica, English Series, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Zhi Guo, Zhao, Zhen Jiang
openaire   +2 more sources

PROPERTIES OF FRACTIONAL K -FACTORS OF GRAPHS

Acta Mathematica Scientia, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Guizhen, Zhang, Lanju
openaire   +2 more sources

A K-Factor CPU Scheduling Algorithm

2018 9th International Conference on Computing, Communication and Networking Technologies (ICCCNT), 2018
In a multi-tasking environment, it is crucial to optimize the CPU scheduling process. Several algorithms have been proposed and are in use to schedule processes on CPU. This paper aims to evaluate shortest job first (SJF) algorithm and propose an algorithm to overcome the shortcomings of SJF.
Sumedha Garg, Deepak Kumar
openaire   +2 more sources

Corrigendum: On fractional K‐factors of random graphs

Random Structures & Algorithms, 2008
AbstractWe regret that the article “On Fractional K‐Factors of Random Graphs,” which appeared in Random Structures and Algorithms (Haber and Krivelevich 30 (2007), 441–463), had an inaccuracy in Lemma 6.1. This in turn led to a misstatement in the description of a family of graphs demonstrating the tightness of the main result.
Simi Haber, Michael Krivelevich
openaire   +1 more source

(2,k)-Factor-Critical Graphs and Toughness

Graphs and Combinatorics, 1999
A graph \(G\) is \((r,k)\)-factor-critical if \(G-W\) has an \(r\)-factor for every \(W\subseteq V(G)\) with \(|W|= k\). It is shown that every \(\tau\)-tough graph of order \(n\) with \(\tau\geq 2\) is \((2,k)\)-factor-critical for every nonnegative integer \(k\leq \min\{2\tau-2, n- 3\}\). This settles a conjecture of Liu and Yu.
Mao-cheng Cai   +2 more
openaire   +3 more sources

(3,k)-Factor-Critical Graphs and Toughness

Graphs and Combinatorics, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Minyong Shi   +3 more
openaire   +3 more sources

An Assessment of K Factor Formulas

Engineering Journal, 1995
Current structural design practices recognize that the maximum strength of frames and the maximum strength of component members are interdependent, but it is not practical to take this interdependence into account rigorously. This reasoning lends support to the Structural Stability Research Council (SSRC) technical memorandum which states that "in ...
Nandivaram E. Shanmugam, Wai-Fah Chen
openaire   +1 more source

Home - About - Disclaimer - Privacy