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
1071
search results - page 215 / 215
»
Programming with enumerable sets of structures
Sort
relevance
views
votes
recent
update
View
thumb
title
54
click to vote
ICALP
2009
Springer
208
views
Programming Languages
»
more
ICALP 2009
»
Counting Subgraphs via Homomorphisms
14 years 11 months ago
Download
www.ii.uib.no
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
claim paper
Read More »
« Prev
« First
page 215 / 215
Last »
Next »