TITLE

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width

AUTHOR(S)
Courcelle, B.; Makowsky, J. A.; Rotics, U.
PUB. DATE
March 2000
SOURCE
Theory of Computing Systems;Mar/Apr2000, Vol. 33 Issue 2, p125
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Discusses the development of applications for graphs of clique-width and cographs. Theorems; Graph presentations for logically oriented work; Linear algorithms for optimization problems on P[sub 4]-sparse graphs.
ACCESSION #
3800938

Tags: DECOMPOSITION method;  COMPUTER algorithms

 

Related Articles

  • Application of multi-dimensional index matching in Pub/Sub system. Song Yu; Wu Yan; Qiao Ling-ling // Journal of Communication & Computer;Dec2009, Vol. 6 Issue 12, p9 

    The use of violence matching algorithm in the Publish/Subscribe system impacts the system time. This paper establishes the constraint collections, the events constraint collections and the mapping list of subscription constraint through decomposing and treating the subscribed news. Furthermore,...

  • A Decomposition Based Algorithm of Graph Containment Query. Li Xian-Tong; Li Jian-Zhong // Information Technology Journal;2009, Vol. 8 Issue 2, p214 

    In this study, an algorithm ESGC is proposed to implement graph containment query problem, both exact and similar. The index of ESGC is built on two parts, the process of graph dataset decomposition and a hash table. The processing of graph dataset decomposition forms a structure which reduces...

  • A procedure to decompose high resolution mass spectra. Barbarini, Nicola; Magni, Paolo; Bellazzi, Riccardo // BMC Bioinformatics;2007 Supplement 8, Vol. 8, Special section p1 

    Background The proposed procedure can be applied to two different studies. The first one is discovering proteomic patterns by SELDI-TOF mass spectra. The application of the procedure has the aim of finding how many proteins are represented in the spectrum of the sample, among which to search the...

  • On decomposition methods for tandem queueing networks with blocking. Dallery, Yves; Frein, Yannick // Operations Research;Mar/Apr93, Vol. 41 Issue 2, p386 

    Queueing networks with blocking are useful for modeling and analyzing discrete event systems, especially manufacturing systems. Most analysis methods for queueing networks with blocking are approximation methods that involve a decomposition of the network into a set of subsystems. This paper...

  • Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems. de Leone, Renato; Gaudioso, Manlio; Monaco, Maria Flavia // Annals of Operations Research;1993, Vol. 44 Issue 1-4, p299 

    We develop an iterative algorithm based on right-hand side decomposition for the solution of multicommodity network flow problems. At each step of the proposed iterative procedure the coupling constraints are eliminated by subdividing the shared capacity resource among the different commodities...

  • Design of Output Codes for Fast Covering Learning using Basic Decomposition Techniques. Tiwari, Aruna; Chaudhari, Narendra S. // Journal of Computer Science;2006, Vol. 2 Issue 7, p565 

    We propose the design of output codes for solving the classification problem in Fast Covering Learning Algorithm (FCLA). For a complex multi-class problem normally the classifiers are constructed by combining the outputs of several binary ones. In this paper, we use the basic methods of...

  • Applications of Rough Set Decompositions in Information Retrieval. Chen Wu; Xiaohua Hu // International Journal of Electrical & Electronics Engineering;Nov2010, Vol. 4 Issue 4, p285 

    This paper proposes rough set models with three different level knowledge granules in incomplete information system under tolerance relation by similarity between objects according to their attribute values. Through introducing dominance relation on the discourse to decompose similarity classes...

  • INTEGER PROGRAMMING ALGORITHMS: A FRAMEWORK AND STATE-OF-THE-ART SURVEY. Geoffrion, A. M.; Marsten, R. E. // Management Science;May72, Vol. 18 Issue 9, p465 

    A unifying framework is developed to facilitate the understanding of most known computational approaches to integer programming. A number of currently operational algorithms are related to this framework, and prospects for future progress are assessed.

  • To the article �Domain decomposition method with hybrid approximations applied to solve problems of elasticity� by A. Ya. Grigorenko, I. I. Dyyak, and I. I. Prokopyshin, International Applied Mechanics, Vol. 44, No. 11, pp. 1213�... Grigorenko, A.; Dyyak, I.; Prokopyshyn, I. // International Applied Mechanics;Apr2009, Vol. 45 Issue 4, p468 

    A correction to the article "Domain decomposition method with hybrid approximations applied to solve problems of elasticity" that was published in the November 2008 issue is presented.

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics