Series-parallel graph

Results: 12



#Item
1Race Detection in Two Dimensions Dimitar Dimitrov Martin Vechev  Vivek Sarkar

Race Detection in Two Dimensions Dimitar Dimitrov Martin Vechev Vivek Sarkar

Add to Reading List

Source URL: www.srl.inf.ethz.ch

Language: English - Date: 2015-05-03 19:24:30
2On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs Michael A. Bender Jeremy T. Fineman

On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs Michael A. Bender Jeremy T. Fineman

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2007-09-28 06:21:25
3Iterative-Free Program Analysis Mizuhito Ogawa†∗  Zhenjiang Hu‡∗

Iterative-Free Program Analysis Mizuhito Ogawa†∗ Zhenjiang Hu‡∗

Add to Reading List

Source URL: www.sic.shibaura-it.ac.jp

Language: English - Date: 2004-01-13 00:18:34
4Degree distribution in random planar graphs Michael Drmota∗ Omer Gim´enez†  Marc Noy‡

Degree distribution in random planar graphs Michael Drmota∗ Omer Gim´enez† Marc Noy‡

Add to Reading List

Source URL: www.dmg.tuwien.ac.at

Language: English - Date: 2008-09-20 01:50:49
5The maximum degree of planar graphs I. Series-parallel graphs Michael Drmota∗ Omer Gim´enez†

The maximum degree of planar graphs I. Series-parallel graphs Michael Drmota∗ Omer Gim´enez†

Add to Reading List

Source URL: www.dmg.tuwien.ac.at

Language: English - Date: 2010-04-09 02:13:52
6VERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS MICHAEL DRMOTA, OMER GIMENEZ, AND MARC NOY Abstract. We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size

VERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS MICHAEL DRMOTA, OMER GIMENEZ, AND MARC NOY Abstract. We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size

Add to Reading List

Source URL: www.dmg.tuwien.ac.at

Language: English - Date: 2008-04-04 13:06:24
7Reachability in K3,3-free and K5-free Graphs is in Unambiguous Logspace

Reachability in K3,3-free and K5-free Graphs is in Unambiguous Logspace

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2014-04-18 22:07:45
8On Mimicking Networks Shiva Chaudhuriy K.V. Subrahmanyamy Frank Wagnerz December 4, 1997

On Mimicking Networks Shiva Chaudhuriy K.V. Subrahmanyamy Frank Wagnerz December 4, 1997

Add to Reading List

Source URL: edocs.fu-berlin.de

Language: English - Date: 2013-11-28 19:46:12
9On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs Michael A. Bender Jeremy T. Fineman

On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs Michael A. Bender Jeremy T. Fineman

Add to Reading List

Source URL: supertech.csail.mit.edu

Language: English - Date: 2014-09-16 08:27:51
10Finding Partial Orders from Unordered 0-1 Data Antti Ukkonen Mikael Fortelius  Heikki Mannila

Finding Partial Orders from Unordered 0-1 Data Antti Ukkonen Mikael Fortelius Heikki Mannila

Add to Reading List

Source URL: www.helsinki.fi

Language: English - Date: 2010-03-17 09:48:37