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
882
search results - page 28 / 177
»
On the Hardness of Graph Isomorphism
Sort
relevance
views
votes
recent
update
View
thumb
title
30
click to vote
ESA
2006
Springer
137
views
Algorithms
»
more
ESA 2006
»
Deciding Relaxed Two-Colorability - A Hardness Jump
14 years 19 days ago
Download
www.inf.ethz.ch
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
claim paper
Read More »
29
click to vote
WG
2009
Springer
81
views
Theoretical Computer Science
»
more
WG 2009
»
Hardness Results and Efficient Algorithms for Graph Powers
14 years 1 months ago
Download
www.lirmm.fr
Van Bang Le, Nguyen Ngoc Tuy
claim paper
Read More »
9
click to vote
AAAI
2008
100
views
Intelligent Agents
»
more
AAAI 2008
»
Generating Hard SAT/CSP Instances Using Expander Graphs
13 years 11 months ago
Download
www.aaai.org
Carlos Ansótegui, Ramón Béjar...
claim paper
Read More »
29
click to vote
CPM
2008
Springer
170
views
Combinatorics
»
more
CPM 2008
»
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
13 years 10 months ago
Download
www.cs.ucr.edu
Nadja Betzler, Michael R. Fellows, Christian Komus...
claim paper
Read More »
25
click to vote
FOCS
2010
IEEE
140
views
Theoretical Computer Science
»
more
FOCS 2010
»
Hardness of Finding Independent Sets in Almost 3-Colorable Graphs
13 years 7 months ago
Download
www.cims.nyu.edu
Irit Dinur, Subhash Khot, Will Perkins, Muli Safra
claim paper
Read More »
« Prev
« First
page 28 / 177
Last »
Next »