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
91
search results - page 19 / 19
»
Pathwidth of outerplanar graphs
Sort
relevance
views
votes
recent
update
View
thumb
title
49
click to vote
IWPEC
2009
Springer
134
views
Applied Computing
»
more
IWPEC 2009
»
What Makes Equitable Connected Partition Easy
14 years 5 months ago
Download
faculty.cs.tamu.edu
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
claim paper
Read More »
« Prev
« First
page 19 / 19
Last »
Next »