Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
66
search results - page 1 / 14
»
Cycles in dense digraphs
Sort
relevance
views
votes
recent
update
View
thumb
title
12
click to vote
COMBINATORICA
2008
95
views
more
COMBINATORICA 2008
»
Cycles in dense digraphs
13 years 7 months ago
Download
www.math.princeton.edu
Maria Chudnovsky, Paul D. Seymour, Blair Sullivan
claim paper
Read More »
22
click to vote
EJC
2006
80
views
Information Technology
»
more
EJC 2006
»
Hamiltonicity of digraphs for universal cycles of permutations
13 years 7 months ago
Download
www.lehigh.edu
The digraphs P(n, k) have vertices corresponding to length k permutations of an n set and arcs corresponding to (k + 1) permutations. Answering a question of Starling, Klerlein, K...
Garth Isaak
claim paper
Read More »
23
click to vote
SIAMDM
2008
101
views
more
SIAMDM 2008
»
Hamilton Cycles in Random Lifts of Directed Graphs
13 years 7 months ago
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 »
14
click to vote
EJC
2010
113
views
Information Technology
»
more
EJC 2010
»
Counting paths in digraphs
13 years 7 months ago
Download
www.ornl.gov
Say a digraph is k-free if it has no directed cycles of length at most k, for k Z+ . Thomass
Paul D. Seymour, Blair Sullivan
claim paper
Read More »
27
click to vote
ISAAC
1994
Springer
95
views
Algorithms
»
more
ISAAC 1994
»
Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem
13 years 11 months ago
Download
www.ceid.upatras.gr
We present here an algorithm for detecting (and outputting, if exists) a negative cycle in an n-vertex planar digraph G with real
Dimitris J. Kavvadias, Grammati E. Pantziou, Paul ...
claim paper
Read More »
« Prev
« First
page 1 / 14
Last »
Next »