نتایج جستجو برای: partial fuzzy subgraph

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

2011
Toly Chen

To further enhance the accuracy and precision of DRAM price forecasting, a hybrid fuzzy and neural approach with virtual experts and partial consensus is proposed. In the proposed methodology, some virtual experts form a committee. These virtual experts construct their own fuzzy linear regression (FLR) equations to forecast the price of a DRAM product from various viewpoints. Each FLR equation ...

Journal: :Discrete Mathematics 1999
Kenneth P. Bogart Douglas B. West

A short proof is given that the graphs with proper interval representations are the same as the graphs with unit interval representations. An graph is an interval graph if its vertices can be assigned intervals on the real line so that vertices are adjacent if and only if the corresponding intervals intersect; such an assignment is an interval representation. When the intervals have the same le...

2010
S. Gnanasekaran

Berstel and Pin have characterized local languages by introducing local automaton. In this paper fuzzy local language is introduced and the fuzzy local languages recognized by partial fuzzy local automata in max-min and min-max compositions are studied. Some closure properties of fuzzy local languages are provided. Mathematics Subject Classification: 68Q45

2007
Ondrej Pavlacka Jana Talasová

The paper deals with the operation of fuzzy weighted average of fuzzy numbers. The operation can be applied to the aggregation of partial fuzzy evaluations in fuzzy models of multiple criteria decision making and to the computation of expected fuzzy evaluations of alternatives in discrete fuzzy-stochastic models of decision making under risk. Normalized fuzzy weights figuring in the operation h...

1994
Arvind Gupta Naomi Nishimura

We present sequential and parallel algorithms for various embedding problems on bounded degree partial k trees and k connected partial k trees these include subgraph isomorphism and topological embedding known to be NP complete for general partial k trees As well as contributing to our understanding of the types of graphs for which these problems are tractable this paper introduces new methods ...

Journal: :Discussiones Mathematicae Graph Theory 2013
Boram Park Yoshio Sano

The competition graph of a doubly partial order is known to be an interval graph. The CCE graph and the niche graph of a doubly partial order are also known to be interval graphs if the graphs do not contain a cycle of length four and three as an induced subgraph, respectively. Phylogeny graphs are variant of competition graphs. The phylogeny graph P (D) of a digraph D is the (simple undirected...

Journal: :journal of algorithms and computation 0
kristiana wijaya combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia lyra yulianti department of mathematics, faculty of mathematics and natural sciences, andalas university, kampus unand limau manis padang 25136 indonesia edy tri baskoro combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia hilda assiyatun combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia djoko suprijanto combinatorial mathematics research group, faculty of mathematics and natural sciences, institut teknologi bandung (itb), jalan ganesa 10 bandung 40132 indonesia

let f, g and h be non-empty graphs. the notation f → (g,h) means that if any edge of f is colored by red or blue, then either the red subgraph of f con- tains a graph g or the blue subgraph of f contains a graph h. a graph f (without isolated vertices) is called a ramsey (g,h)−minimal if f → (g,h) and for every e ∈ e(f), (f − e) 9 (g,h). the set of all ramsey (g,h)−minimal graphs is denoted by ...

Journal: :Expert Syst. Appl. 2011
Ioannis Patiniotakis Dimitris Apostolou Gregoris Mentzas

We propose Fuzzy UTASTAR, a method for inferring fuzzy utility functions from a partial preorder of options evaluated on multiple criteria. It is an extension of the well-known UTASTAR method capable to handle both ordinary (crisp) and fuzzy evaluation data. This property gives much flexibility to decision makers because the majority of real-life decision problems involve a considerable level o...

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

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