<--- Back to Details
First PageDocument Content
Graph theory / Bipartite graphs / Degree / Planar graph / Outerplanar graph / Treewidth / Chordal graph / Tree / Matching / Graph coloring
Date: 2009-07-03 08:57:23
Graph theory
Bipartite graphs
Degree
Planar graph
Outerplanar graph
Treewidth
Chordal graph
Tree
Matching
Graph coloring

Fixed-parameter algorithms for protein similarity search under mRNA structure constraints Guillaume Blin1 , Guillaume Fertin1 , Danny Hermelin2 , and St´ephane Vialette3 1

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Download Document from Source Website

File Size: 148,17 KB

Share Document on Facebook

Similar Documents

THE DUCKDUCKGO $500,000 PRIVACY CHALLENGE $3,000 DOLLAR FOR DOLLAR DONATION MATCHING INCENTIVE OFFICIAL RULES The DuckDuckGo $500,000 Privacy Challenge (the “Challenge”) $3,000 Dollar-for-Dollar Donation Matching Inc

THE DUCKDUCKGO $500,000 PRIVACY CHALLENGE $3,000 DOLLAR FOR DOLLAR DONATION MATCHING INCENTIVE OFFICIAL RULES The DuckDuckGo $500,000 Privacy Challenge (the “Challenge”) $3,000 Dollar-for-Dollar Donation Matching Inc

DocID: 1xW1O - View Document

Rules and Procedures Overview Kickstart:Wyoming Program SBIR Phase I and II Matching Program  1

Rules and Procedures Overview Kickstart:Wyoming Program SBIR Phase I and II Matching Program 1

DocID: 1xVRT - View Document

Computational Social Choice  UPS Toulouse, 2015 Matching In a variant of the fair allocation problem, we try to match each agent

Computational Social Choice UPS Toulouse, 2015 Matching In a variant of the fair allocation problem, we try to match each agent

DocID: 1xVtU - View Document

Unfailing Haskell: A Static Checker for Pattern Matching Neil Mitchell and Colin Runciman http://www.cs.york.ac.uk/∼ndm , http://www.cs.york.ac.uk/∼colin  University of York, UK

Unfailing Haskell: A Static Checker for Pattern Matching Neil Mitchell and Colin Runciman http://www.cs.york.ac.uk/∼ndm , http://www.cs.york.ac.uk/∼colin University of York, UK

DocID: 1xVgx - View Document

Efficient E-matching for SMT Solvers Leonardo de Moura, Nikolaj Bjørner Microsoft Research, Redmond

Efficient E-matching for SMT Solvers Leonardo de Moura, Nikolaj Bjørner Microsoft Research, Redmond

DocID: 1xV4c - View Document