Pathwidth

Results: 53



#Item
41PowerLyra: Differentiated Graph Computation and Partitioning on Skewed Graphs Rong Chen, Jiaxin Shi, Yanzhe Chen, Haibo Chen Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed

PowerLyra: Differentiated Graph Computation and Partitioning on Skewed Graphs Rong Chen, Jiaxin Shi, Yanzhe Chen, Haibo Chen Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed

Add to Reading List

Source URL: ipads.se.sjtu.edu.cn

Language: English - Date: 2015-03-30 09:08:29
42Preferential Attachment in Graphs with Affinities  Jay-Yoon Lee* Manzil Zaheer* Stephan G¨

Preferential Attachment in Graphs with Affinities Jay-Yoon Lee* Manzil Zaheer* Stephan G¨

Add to Reading List

Source URL: manzil.ml

Language: English - Date: 2016-01-03 02:26:34
43Decomposition by maximal cliques and forbidden subgraphs for path graphs Hugo Nobrega1 COPPE/Engenharia de Sistemas e Computa¸ca ˜o Universidade Federal do Rio de Janeiro

Decomposition by maximal cliques and forbidden subgraphs for path graphs Hugo Nobrega1 COPPE/Engenharia de Sistemas e Computa¸ca ˜o Universidade Federal do Rio de Janeiro

Add to Reading List

Source URL: dl.dropboxusercontent.com

Language: English
44Immunity and Information Sensitivity of Complex Product Design Process in Overlap Decomposition Mahmoud Efatmaneshnik  Carl Reidsema

Immunity and Information Sensitivity of Complex Product Design Process in Overlap Decomposition Mahmoud Efatmaneshnik Carl Reidsema

Add to Reading List

Source URL: necsi.edu

Language: English - Date: 2008-02-15 16:45:14
45Sheep: A Scalable Distributed Graph Partitioner Daniel Margo  Margo Seltzer  Algorithm Problem

Sheep: A Scalable Distributed Graph Partitioner Daniel Margo Margo Seltzer Algorithm Problem

Add to Reading List

Source URL: acmsocc.github.io

Language: English - Date: 2016-02-21 03:10:50
46Parameterized Complexity of Critical Node Cuts Danny Hermelin1 , Moshe Kaspi1 , Christian Komusiewicz2 , and Barak Navon1 1  2

Parameterized Complexity of Critical Node Cuts Danny Hermelin1 , Moshe Kaspi1 , Christian Komusiewicz2 , and Barak Navon1 1 2

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2015-11-09 10:22:02
47Recognizing k-equistable graphs in FPT time? Eun Jung Kim1 , Martin Milaniˇc2 , and Oliver Schaudt3 1 3

Recognizing k-equistable graphs in FPT time? Eun Jung Kim1 , Martin Milaniˇc2 , and Oliver Schaudt3 1 3

Add to Reading List

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

Language: English - Date: 2015-02-26 04:11:59
48Bounded Persistence Pathwidth Rodney G. Downey1 Catherine McCartin2  1

Bounded Persistence Pathwidth Rodney G. Downey1 Catherine McCartin2 1

Add to Reading List

Source URL: www.mcs.vuw.ac.nz

Language: English - Date: 2004-11-22 21:12:21
    49StarClique: Guaranteeing User Privacy in Social Networks Against Intersection Attacks Krishna P. N. Puttaswamy, Alessandra Sala, and Ben Y. Zhao Computer Science Department, University of California at Santa Barbara  {kr

    StarClique: Guaranteeing User Privacy in Social Networks Against Intersection Attacks Krishna P. N. Puttaswamy, Alessandra Sala, and Ben Y. Zhao Computer Science Department, University of California at Santa Barbara {kr

    Add to Reading List

    Source URL: www.cs.ucsb.edu

    Language: English - Date: 2009-12-11 17:22:29
    50C:/Users/Oliver/Dropbox/Andrea-Bang-Oliver/ptolemaic-roots/ptolesplit-journal.dvi

    C:/Users/Oliver/Dropbox/Andrea-Bang-Oliver/ptolemaic-roots/ptolesplit-journal.dvi

    Add to Reading List

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

    Language: English - Date: 2014-01-29 06:00:42