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
553
search results - page 19 / 111
»
Cover Contact Graphs
Sort
relevance
views
votes
recent
update
View
thumb
title
86
click to vote
ICALP
2005
Springer
95
views
Programming Languages
»
more
ICALP 2005
»
Optimal Cover Time for a Graph-Based Coupon Collector Process
15 years 9 months ago
Download
www.cs.utexas.edu
Nedialko B. Dimitrov, C. Greg Plaxton
claim paper
Read More »
110
click to vote
COCOON
2004
Springer
62
views
Combinatorics
»
more
COCOON 2004
»
One-to-Many Disjoint Path Covers in a Graph with Faulty Elements
15 years 9 months ago
Download
tcs.cuk.ac.kr
Jung-Heum Park
claim paper
Read More »
125
click to vote
ISAAC
2004
Springer
96
views
Algorithms
»
more
ISAAC 2004
»
Many-to-many Disjoint Path Covers in a Graph with Faulty Elements
15 years 9 months ago
Download
tcs.cuk.ac.kr
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
claim paper
Read More »
136
click to vote
WG
1994
Springer
131
views
Theoretical Computer Science
»
more
WG 1994
»
Complexity of Graph Covering Problems
15 years 8 months ago
Download
reference.kfupm.edu.sa
Jan Kratochvíl, Andrzej Proskurowski, Jan A...
claim paper
Read More »
120
click to vote
CPC
2008
114
views
more
CPC 2008
»
Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
15 years 4 months ago
Download
www.cdam.lse.ac.uk
In 1998 Luczak, R
Peter Allen
claim paper
Read More »
« Prev
« First
page 19 / 111
Last »
Next »