Sciweavers

1736 search results - page 50 / 348

» On antimagic directed graphs

20

JGAA
2008

45views more JGAA 2008»

Using a Significant Spanning Tree to Draw a Directed Graph

13 years 10 months ago

Using a Significant Spanning Tree to Draw a Directed Graph

Download jgaa.info

Martin Harrigan, Patrick Healy

claim paper

Read More »

22

JEA
2006

85views more JEA 2006»

A dynamic topological sort algorithm for directed acyclic graphs

13 years 10 months ago

A dynamic topological sort algorithm for directed acyclic graphs

Download www.doc.ic.ac.uk

David J. Pearce, Paul H. J. Kelly

claim paper

Read More »

20

ORDER
2008

54views more ORDER 2008»

Word Problem of the Perkins Semigroup via Directed Acyclic Graphs

13 years 10 months ago

Word Problem of the Perkins Semigroup via Directed Acyclic Graphs

Download www.ru.is

Sergey Kitaev, Steve Seif

claim paper

Read More »

28

SIAMDM
2008

101views more SIAMDM 2008»

Hamilton Cycles in Random Lifts of Directed Graphs

13 years 10 months ago

Hamilton Cycles in Random Lifts of Directed Graphs

Download www.math.cmu.edu

An n-lift of a digraph K, is a digraph with vertex set V (K)

Prasad Chebolu, Alan M. Frieze

claim paper

Read More »

35

TCS
2008

108views Theoretical Computer Science» more TCS 2008»

The NP-hardness of finding a directed acyclic graph for regular resolution

13 years 10 months ago

The NP-hardness of finding a directed acyclic graph for regular resolution

Download www2.tcs.ifi.lmu.de

Let R be a resolution refutation, given as a sequence of clauses without explicit description of the underlying dag. Then, it is NPcomplete to decide whether R is a regular resolu...

Samuel R. Buss, Jan Hoffmann 0002

claim paper

Read More »

« Prev « First page 50 / 348 Last » Next »