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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
66
search results - page 4 / 14
»
Cycles in dense digraphs
Sort
relevance
views
votes
recent
update
View
thumb
title
95
Voted
DISOPT
2006
48
views
more
DISOPT 2006
»
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs
15 years 3 months ago
Download
eprints.pascal-network.org
Jørgen Bang-Jensen, Gregory Gutin, Anders Y...
claim paper
Read More »
104
Voted
JCT
2008
57
views
more
JCT 2008
»
k-Ordered Hamilton cycles in digraphs
15 years 3 months ago
Download
web.mat.bham.ac.uk
Daniela Kühn, Deryk Osthus, Andrew Young
claim paper
Read More »
94
Voted
JCT
2002
54
views
more
JCT 2002
»
Disjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs
15 years 3 months ago
Download
uweb.txstate.edu
Richard A. Brualdi, Jian Shen
claim paper
Read More »
86
click to vote
SIAMDM
2010
103
views
more
SIAMDM 2010
»
A Semiexact Degree Condition for Hamilton Cycles in Digraphs
15 years 1 months ago
Download
christofides.org
Demetres Christofides, Peter Keevash, Daniela K&uu...
claim paper
Read More »
136
Voted
AAIM
2008
Springer
120
views
Algorithms
»
more
AAIM 2008
»
Minimum Cost Homomorphism Dichotomy for Oriented Cycles
15 years 10 months ago
Download
www.cs.rhul.ac.uk
For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with co...
Gregory Gutin, Arash Rafiey, Anders Yeo
claim paper
Read More »
« Prev
« First
page 4 / 14
Last »
Next »