Results 141 to 150 of about 35,279 (159)

Efficacy of carbonyl cyanide-3-chlorophenylhydrazone in combination with antibiotics against <i>Mycobacterium abscessus</i>. [PDF]

Microbiol Spectr
Zheng J, Liu Q, Wang H, Huo F, Jia J, Huang H, Chen S.   +6 more
europepmc   +1 more source

Gridline indifference graphs

Mathematical Social Sciences, 2006
Abstract Indifference graphs can be realized on a line with vertices adjacent whenever they are within a given distance. These well-studied graphs have applications to many fields including ecology, cluster theory, and psychology, in the placement of objects in a single dimension. The extension to the grid and higher dimensions has been considered in
Dale Peterson
openalex   +3 more sources

Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders

SIAM Journal on Discrete Mathematics, 1994
The authors extend the notion of indifference graphs to digraphs. A digraph with edge set \(E\) is an indifference digraph if there exists an ordered pair of real valued functions \(f\), \(g\) on the vertices \(u\), \(v\) satisfying \(uv\in E\) if and only if \(| f(u)- g(v)|\leq 1\).
M. K. Sen, Barum K. Sanyal
openalex   +4 more sources

A characterization ofP4-indifference graphs

Journal of Graph Theory, 1999
This paper answers a conjecture that the number of shredders in a graph on \(n\) vertices is at most \(n\), see \textit{J. Cheriyan} and \textit{R. Thurimella} [Proceedings of the 28th annual ACM symposium on the theory of computing (STOC). Philadelphia, PA, USA, May 22-24, 1996. New York, NY: ACM, 37-46 (1996; Zbl 0924.68100)].
Chı́nh T. Hoàng, Frédéric Maffray, Marc Noy   +2 more
  +21 more sources

Vector Domination in split-indifference graphs

Information Processing Letters, 2019
Abstract Given a graph G = ( V , E ) and a vector of nonnegative integers R [ u ] u ∈ V (the vertex requirements), a set S ⊆ V is an R-dominating set of G if each u ∈ V ∖ S has at least R [ u ] neighbors in S. The Vector Domination problem aims at finding a minimum R-dominating set S. In this
Rodrigo Lamblet Mafort, Fábio Protti
openalex   +3 more sources

Double Semiorders and Double Indifference Graphs

SIAM Journal on Algebraic Discrete Methods, 1982
The notion of semiorder was introduced by Luce in 1956 as a model for preference in the situation where indifference judgments are nontransitive. The notion of indifference graph was introduced by Roberts in 1968 as a model for nontransitive indifference.
Margaret B. Cozzens, Fred S. Roberts
openalex   +4 more sources

Single row routing with indifference graphs on the DAP

Proceedings IEEE Southeastcon '92, 2003
The distributed array of processors (DAP) is a commercially available massively parallel machine which is often applied to numerically intensive problems which exploit its matrix manipulation abilities. It is shown that the DAP can be efficiently used to solve non-numerical problems as well.
D. Chennapragada, P. Looges, Stephan Olariu   +2 more
openalex   +3 more sources

Edge Colouring Reduced Indifference Graphs

, 2000
The chromatic index problem – finding the minimum number of colours required for colouring the edges of a graph – is still unsolved for indifference graphs, whose vertices can be linearly ordered so that the vertices contained in the same maximal clique are consecutive in this order.
Celina M.H. de Figueiredo, Célia Picinin de Mello, Carmen Ortiz   +2 more
openalex   +3 more sources

Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P 4’s

, 2004
The simple max-cut problem is as follows: given a graph, find a partition of its vertex set into two disjoint sets, such that the number of edges having one endpoint in each set is as large as possible. A split graph is a graph whose vertex set admits a partition into a stable set and a clique.
Hans L. Bodlaender, Celina M.H. de Figueiredo, Marisa Gutiérrez, Ton Kloks, Rolf Niedermeier   +4 more
openalex   +4 more sources