Clique cover

Results: 36



#Item
1CS264: Homework #5 Due by midnight on Wednesday, October 29, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at http://rishig.sc

CS264: Homework #5 Due by midnight on Wednesday, October 29, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at http://rishig.sc

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-10-27 18:59:34
2Using Strong Triadic Closure to Characterize Ties in Social Networks Stavros Sintos Panayiotis Tsaparas

Using Strong Triadic Closure to Characterize Ties in Social Networks Stavros Sintos Panayiotis Tsaparas

Add to Reading List

Source URL: www.cs.uoi.gr

Language: English - Date: 2014-09-25 06:28:22
3Microsoft Wordtext.nativedoc

Microsoft Wordtext.nativedoc

Add to Reading List

Source URL: web.uvic.ca

Language: English - Date: 2012-11-03 03:43:42
4Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis

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
5Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind†

Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind†

Add to Reading List

Source URL: www.levreyzin.com

Language: English - Date: 2016-07-01 10:19:11
6Structural parameterizations for boxicity Henning Bruhn, Morgan Chopin, Felix Joos and Oliver Schaudt Abstract The boxicity of a graph G is the least integer d such that G has an intersection model of axis-aligned d-dime

Structural parameterizations for boxicity Henning Bruhn, Morgan Chopin, Felix Joos and Oliver Schaudt Abstract The boxicity of a graph G is the least integer d such that G has an intersection model of axis-aligned d-dime

Add to Reading List

Source URL: www.zaik.uni-koeln.de

Language: English - Date: 2014-02-20 07:20:59
7Data Reduction, Exact, and Heuristic Algorithms for Clique Cover Jens Gramm Jiong Guo

Data Reduction, Exact, and Heuristic Algorithms for Clique Cover Jens Gramm Jiong Guo

Add to Reading List

Source URL: www.user.tu-berlin.de

Language: English - Date: 2013-01-21 07:02:09
    8

    PDF Document

    Add to Reading List

    Source URL: fpt.akt.tu-berlin.de

    Language: English - Date: 2014-10-07 11:22:31
    9Vertex Cover Gets Faster and Harder on Low Degree Graphs Akanksha Agrawal1 , Sathish Govindarajan1 , Neeldhara Misra1 Indian Institute of Science, Bangalore {akanksha.agrawal|gsat|neeldhara}@csa.iisc.ernet.in

    Vertex Cover Gets Faster and Harder on Low Degree Graphs Akanksha Agrawal1 , Sathish Govindarajan1 , Neeldhara Misra1 Indian Institute of Science, Bangalore {akanksha.agrawal|gsat|neeldhara}@csa.iisc.ernet.in

    Add to Reading List

    Source URL: drona.csa.iisc.ernet.in

    Language: English - Date: 2014-08-01 08:33:48
    10CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic

    CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic

    Add to Reading List

    Source URL: stanford.edu

    Language: English - Date: 2015-03-23 01:42:07