Results 1  10
of
6,027
Averaging Operators in the Unit Interval
 Int. J. Intell. Syst
, 1999
"... In working with negations and tnorms, it is not uncommon to call upon the arithmetic of the real numbers even though that is not part of the structure of the unit interval as a bounded lattice. In order to develop a selfcontained system, we incorporate an averaging operator, which provides a (cont ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In working with negations and tnorms, it is not uncommon to call upon the arithmetic of the real numbers even though that is not part of the structure of the unit interval as a bounded lattice. In order to develop a selfcontained system, we incorporate an averaging operator, which provides a
CliqueWidth of Unit Interval Graphs
, 709
"... The cliquewidth is known to be unbounded in the class of unit interval graphs. In this paper, we show that this is a minimal hereditary class of unbounded cliquewidth, i.e., in every hereditary subclass of unit interval graphs the cliquewidth is bounded by a constant. Keywords: Unit interval grap ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The cliquewidth is known to be unbounded in the class of unit interval graphs. In this paper, we show that this is a minimal hereditary class of unbounded cliquewidth, i.e., in every hereditary subclass of unit interval graphs the cliquewidth is bounded by a constant. Keywords: Unit interval
The partition function of the unit interval
, 1996
"... We outline a method of calculation of partition functions of orientable manifolds with fluctuating metric and perform the calculation for the specific case of the unit interval. Quantum fluctuations of the geometry of spacetime seem to be at the core of the quantization of gravity. In dimensions hi ..."
Abstract
 Add to MetaCart
We outline a method of calculation of partition functions of orientable manifolds with fluctuating metric and perform the calculation for the specific case of the unit interval. Quantum fluctuations of the geometry of spacetime seem to be at the core of the quantization of gravity. In dimensions
Precoloring Extension on Unit Interval Graphs
, 2004
"... In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a proper kcoloring of the graph. Answering an open question of Hujter and Tuza [6], we show that the precoloring exten ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
extension problem is NPcomplete on unit interval graphs.
Integral Mixed Unit Interval Graphs
"... Abstract. We characterize graphs that have intersection representations using unit intervals with open or closed ends such that all ends of the intervals are integral in terms of infinitely many minimal forbidden induced subgraphs. Furthermore, we provide a quadratictime algorithm that decides if a ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. We characterize graphs that have intersection representations using unit intervals with open or closed ends such that all ends of the intervals are integral in terms of infinitely many minimal forbidden induced subgraphs. Furthermore, we provide a quadratictime algorithm that decides
De Morgan Systems on the Unit Interval
"... Logical connectives on fuzzy sets arise from those on the unit interval. The basic theory of these connectives is cast in an algebraic spirit with an emphasis on equivalence between the various systems that arise. Special attention is given to De Morgan systems with strict Archimedean tnorms and st ..."
Abstract
 Add to MetaCart
Logical connectives on fuzzy sets arise from those on the unit interval. The basic theory of these connectives is cast in an algebraic spirit with an emphasis on equivalence between the various systems that arise. Special attention is given to De Morgan systems with strict Archimedean t
Precoloring extension on unit interval graphs¤
, 2004
"... In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a proper kcoloring of the graph. Answering an open question of Hujter and Tuza [6], we show that the precoloring extensio ..."
Simple Linear Time Recognition of Unit Interval Graphs
, 1998
"... We present a linear time algorithm for unit interval graph recognition. The algorithm is simple and based on BreadthFirst Search. It is also direct  it does not first recognize the graph as an interval graph. Given a graph G, the algorithm produces an ordering of the vertices of the graph whe ..."
Abstract

Cited by 44 (1 self)
 Add to MetaCart
We present a linear time algorithm for unit interval graph recognition. The algorithm is simple and based on BreadthFirst Search. It is also direct  it does not first recognize the graph as an interval graph. Given a graph G, the algorithm produces an ordering of the vertices of the graph
Satisfiability Problems on Intervals and Unit Intervals
 THEORETICAL COMPUTER SCIENCE
, 1997
"... For an interval graph with some additional order constraints between pairs of nonintersecting intervals, we give a linear time algorithm to determine if there exists a realization which respects the order constraints. Previous algorithms for this problem (known also as seriation with side constrain ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
For an interval graph with some additional order constraints between pairs of nonintersecting intervals, we give a linear time algorithm to determine if there exists a realization which respects the order constraints. Previous algorithms for this problem (known also as seriation with side
Results 1  10
of
6,027