Perfect graph - PDFSEARCH.IO - Document Search Engine

Perfect graph
Results: 48

#	Item
1	Graph games with perfect information Dietmar Berwanger∗ MPRI Add to Reading List Source URL: www.lsv.fr - Date: 2013-02-21 07:55:45
2	Interval Scheduling to Maximize Bandwidth Provision Mordechai Shalom 1 ∗ Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2013-09-22 04:19:43 Graph theory Graph coloring Independent set Interval graph Interval scheduling Perfect graph Interval edge coloring
3	C Caallll ffoorr P Paappeerrss Discrete Applied Mathematics Special Issue: Algorithmic and Structural Graph Theory _______________________________________________________ Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2015-06-10 13:26:44 Graph theory Mathematics Perfect graph Topological graph theory Graph Planar graph Archimedean graph
4	LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction Add to Reading List Source URL: www.cs.tau.ac.il Language: English - Date: 2009-01-01 08:42:54 Computational complexity theory Graph theory Mathematics Phylogenetics NP-complete problems Computational phylogenetics Analysis of algorithms Probabilistic complexity theory Randomized algorithm Steiner tree problem Algorithm Maximum parsimony
5	Nested Concept Graphs with Cuts: Mathematical Foundations Frithjof Dau, Joachim Hereth Correia Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt, {dau,hereth}@mathematik.t Add to Reading List Source URL: www.dr-dau.net Language: English - Date: 2007-08-09 21:04:38 Graph theory Discrete mathematics Mathematics Matroid theory Graph Ear decomposition End Line graph Trivially perfect graph
6	VERTEX PERFECT GRAPHS By Riley Littlefield A SENIOR RESEARCH PAPER PRESENTED TO THE DEPARTMENT OF Add to Reading List Source URL: www2.stetson.edu Language: English - Date: 2015-04-24 19:11:58 Graph theory Graph operations Graph coloring NP-complete problems Graph Vertex Cycle Degree Ear decomposition Edge contraction Perfect graph Tree
7	CPSCECON, Fall 2011 Solution Set for Exam 2 Question 1: (a) Let G = (V, E, t) be a trust graph, as the term is defined in Section 27.5, and let v0 be a distinguished “start node.” See “Definitio Add to Reading List Source URL: zoo.cs.yale.edu Language: English - Date: 2011-12-22 14:05:18 Game theory Network flow Mathematics Subgame perfect equilibrium Maximum flow problem
8	Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2016-01-12 16:30:06 Graph theory NP-complete problems Graph coloring Triangle-free graph Treewidth Independent set Planar graph Line graph Perfect graph Dominating set Clique cover Graph minor
9	The k -in-a-path problem for claw-free graphs ´ + , Bernard Lidický∗ , Jiˇrí Fiala∗ , Marcin Kaminski Daniël Paulusma∗∗ Charles University∗ Université Libre de Bruxelles+ Add to Reading List Source URL: orion.math.iastate.edu Language: English - Date: 2014-08-22 14:45:35 Graph theory Graph operations Claw-free graph Matching Interval graph Line graph Triangle-free graph Indifference graph Perfect graph