Matching polynomial - PDFSEARCH.IO - Document Search Engine

Matching polynomial
Results: 35

#	Item
1	Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2011-04-27 05:26:37 Graph theory Mathematics NP-complete problems Graph coloring Matching Bipartite graph Color-coding Treewidth Graph Cycle Line graph Chromatic polynomial
2	OPTIMIZING PHYLOGENETIC DIVERSITY ACROSS TWO TREES MAGNUS BORDEWICH, CHARLES SEMPLE, AND ANDREAS SPILLNER Abstract. We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted-su Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2007-10-09 08:45:20 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization Matching Flow network 3-dimensional matching Vertex cover
3	Complexity of the Bollob´ as-Riordan Polynomial Exceptional Points and Uniform Reductions Markus Bl¨ asera , Holger Dellb,⋆ , and Johann A. Makowskyc,⋆⋆ a Add to Reading List Source URL: www-cc.cs.uni-saarland.de Language: English - Date: 2012-05-16 12:01:50 Polynomials Tutte polynomial Chromatic polynomial Matching polynomial Rational function BollobsRiordan polynomial Discriminant
4	Fundamenta Informaticae–6 1 DOIFIIOS Press Add to Reading List Source URL: www-cc.cs.uni-saarland.de Language: English - Date: 2012-05-16 12:06:41 Polynomials Tutte polynomial Chromatic polynomial Matching Matroid SchwartzZippel lemma BollobsRiordan polynomial
5	June 23, :19 WSPC - Proceedings Trim Size: 9in x 6in Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:57:08 Graph coloring NP-complete problems Graph theory Matching Color-coding Graph Chromatic polynomial Tree-depth
6	The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2013-07-11 20:53:15 NP-complete problems Graph coloring Bipartite graph Parity Comparability graph Matching Trapezoid graph Interval graph Graph Independent set Interval edge coloring Planar graph
7	JMLR: Workshop and Conference Proceedings vol 40:1–17, 2015 Label optimal regret bounds for online local learning Pranjal Awasthi∗ PAWASHTI @ CS . PRINCETON . EDU Add to Reading List Source URL: jmlr.org Language: English - Date: 2015-07-20 20:08:35 NP-complete problems Analysis of algorithms Clique problem Planted clique Time complexity Clique Matching Big O notation Matching polynomial Graph coloring
8	Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching Nicol N. Schraudolph Add to Reading List Source URL: nic.schraudolph.org Language: English - Date: 2011-07-24 10:18:33
9	reg4-n50-c512M-b1M.time.ps Add to Reading List Source URL: homepages.ecs.vuw.ac.nz Language: English - Date: 2008-10-16 17:32:45 Graph theory Graph coloring Matroid theory Polynomials Tutte polynomial Chromatic polynomial Matching Ear decomposition Spanning tree Graph Degree Connected component