Acyclic coloring

Results: 37



#Item
1Planarization and acyclic colorings of subcubic claw-free graphs Christine Cheng! , Eric McDermid!! , and Ichiro Suzuki! ! ! Department of Computer Science, University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA {

Planarization and acyclic colorings of subcubic claw-free graphs Christine Cheng! , Eric McDermid!! , and Ichiro Suzuki! ! ! Department of Computer Science, University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA {

Add to Reading List

Source URL: www.cs.uwm.edu

Language: English - Date: 2011-07-31 13:36:56
2c 2004 Cambridge University Press Combinatorics, Probability and Computing, 1–16.  DOI: S0963548303005844 Printed in the United Kingdom Approximating the Number of Acyclic Orientations for a Class of

c 2004 Cambridge University Press Combinatorics, Probability and Computing, 1–16.  DOI: S0963548303005844 Printed in the United Kingdom Approximating the Number of Acyclic Orientations for a Class of

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2004-03-11 06:32:34
3VizzScheduler - A Framework for the Visualization of Scheduling Algorithms Welf Löwe and Alex Liebrich Institut für Programmstrukturen und Datenorganisation, Universität Karlsruhe Postfach 6980, 76128 Karlsruhe, Germa

VizzScheduler - A Framework for the Visualization of Scheduling Algorithms Welf Löwe and Alex Liebrich Institut für Programmstrukturen und Datenorganisation, Universität Karlsruhe Postfach 6980, 76128 Karlsruhe, Germa

Add to Reading List

Source URL: arisa.se

Language: English - Date: 2013-01-05 08:53:31
4   The graph box in the main workspace looks like this: Possible Parent Boxes of the Graph Box: •

  The graph box in the main workspace looks like this: Possible Parent Boxes of the Graph Box: •

Add to Reading List

Source URL: www.phil.cmu.edu

Language: English - Date: 2014-09-22 10:01:55
5CCCG 2013, Waterloo, Ontario, August 8–10, 2013  Grid Proximity Graphs: LOGs, GIGs and GIRLs River Allen∗  Laurie Heyer†

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Grid Proximity Graphs: LOGs, GIGs and GIRLs River Allen∗ Laurie Heyer†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2013-08-11 21:51:57
6498  IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 2, FEBRUARY 2001 Factor Graphs and the Sum-Product Algorithm Frank R. Kschischang, Senior Member, IEEE, Brendan J. Frey, Member, IEEE, and

498 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 2, FEBRUARY 2001 Factor Graphs and the Sum-Product Algorithm Frank R. Kschischang, Senior Member, IEEE, Brendan J. Frey, Member, IEEE, and

Add to Reading List

Source URL: www.psi.toronto.edu

Language: English - Date: 2005-01-17 09:27:09
7Longest Paths in Planar DAGs in Unambiguous Log-Space

Longest Paths in Planar DAGs in Unambiguous Log-Space

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2011-06-02 16:29:35
8Longest Paths in Planar DAGs in Unambiguous Log-Space∗ Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar The Institute of Mathematical Sciences, Chennai, India. Email: {nutan,meena,prajakta}@imsc.res.in 13 Novem

Longest Paths in Planar DAGs in Unambiguous Log-Space∗ Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar The Institute of Mathematical Sciences, Chennai, India. Email: {nutan,meena,prajakta}@imsc.res.in 13 Novem

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2011-06-03 17:31:15
9Malware Analysis with Tree Automata Inference ⋆ Domagoj Babi´c, Daniel Reynaud, and Dawn Song University of California, Berkeley {babic, reynaud, dawnsong}@cs.berkeley.edu  Abstract. The underground malware-based econ

Malware Analysis with Tree Automata Inference ⋆ Domagoj Babi´c, Daniel Reynaud, and Dawn Song University of California, Berkeley {babic, reynaud, dawnsong}@cs.berkeley.edu Abstract. The underground malware-based econ

Add to Reading List

Source URL: bitblaze.cs.berkeley.edu

Language: English - Date: 2013-03-28 20:19:28
10Chapter 3  Decompositions of graphs 3.1 Why graphs? A wide range of problems can be expressed with clarity and precision in the concise pictorial language of graphs. For instance, consider the task of coloring a politica

Chapter 3 Decompositions of graphs 3.1 Why graphs? A wide range of problems can be expressed with clarity and precision in the concise pictorial language of graphs. For instance, consider the task of coloring a politica

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2006-10-03 04:59:02