Clique - PDFSEARCH.IO - Document Search Engine

Clique
Results: 814

#	Item
41	Manual de configuração para a rede sem fios “eduroam” OS X Snow Leopard com certificado 1. Selecione a opção “Open Network Preferences” 2. Clique sobre o cadeado Add to Reading List Source URL: www.medicina.ulisboa.pt Language: Portuguese - Date: 2015-06-22 10:33:45
42	Natural Models for Evolution on Networks George B. Mertzios1 , Sotiris Nikoletseas2, Christoforos Raptopoulos2 , and Paul G. Spirakis2 1 School of Engineering and Computing Sciences, Durham University, UK Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2011-10-13 13:00:39 Graph theory Discrete mathematics Mathematics Graph Degree Clique Vertex Directed graph Ear decomposition Logic of graphs Extremal graph theory
43	Literaturverzeichnis 1. Alizadeh, F): A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs. Proceedings of the second ACMSIAM Symposium on Discrete Algorithms 2. Alizade Add to Reading List Source URL: www.opt.uni-duesseldorf.de Language: English - Date: 2003-10-16 08:07:54 Mathematical optimization Numerical analysis Mathematical analysis Linear programming Convex optimization Interior point method Quadratic programming Global optimization Robert J. Vanderbei Quasi-Newton method Nonlinear programming Linear matrix inequality
44	CS264: Beyond Worst-Case Analysis Lecture #10: Planted and Semi-Random Graph Models∗ Tim Roughgarden† October 22, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-01-05 12:59:35 Graph theory Computational complexity theory Mathematics NP-complete problems Clique problem Planted clique Graph partition Graph coloring Clique Time complexity Maximal independent set Pathwidth
45	Microsoft Wordtext.nativedoc Add to Reading List Source URL: web.uvic.ca Language: English - Date: 2012-11-03 03:43:42 Graph theory Computational complexity theory Mathematics NP-complete problems Vertex cover Clique Degree Connectivity Independent set Graph coloring
46	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
47	Genome Informatics 13: 143–Point Matching Under Non-Uniform Distortions and Protein Side Chain Packing Based on an Efficient Add to Reading List Source URL: www.jsbi.org Language: English - Date: 2002-12-09 05:53:39 Graph theory Mathematics Computational complexity theory NP-complete problems Independent set Clique problem Algorithm Clique Matching
48	Distributed Computing manuscript No. (will be inserted by the editor) Determining Majority in Networks with Local Interactions and very Small Local Memory George B. Mertzios · Sotiris E. Nikoletseas · Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2016-06-12 12:30:49 Graph theory Mathematics Discrete mathematics Graph coloring Graph Clique Randomized algorithm
49	TOCS9478_source.nohead.pdf Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2013-05-14 08:02:16 Graph theory NP-complete problems Circle graph Intersection graph Dominating set Interval graph Chordal graph Graph coloring Treewidth Claw-free graph Clique Planar graph
50	Strong Bounds for Evolution in Networks∗ George B. Mertzios1 and Paul G. Spirakis2,3 1 School of Engineering and Computing Sciences, Durham University, UK 2 Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2013-04-23 14:40:59 Graph theory Mathematics Discrete mathematics Graph Degree Clique Evolutionary graph theory Logic of graphs

UPDATE