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
871
search results - page 37 / 175
»
The vertex-cover polynomial of a graph
Sort
relevance
views
votes
recent
update
View
thumb
title
94
click to vote
DM
2000
80
views
more
DM 2000
»
An attempt to classify bipartite graphs by chromatic polynomials
15 years 6 months ago
Download
math.nie.edu.sg
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles...
claim paper
Read More »
92
click to vote
DM
2002
49
views
more
DM 2002
»
The vertex-cover polynomial of a graph
15 years 6 months ago
Download
math.nie.edu.sg
Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Char...
claim paper
Read More »
113
click to vote
JAL
2000
63
views
more
JAL 2000
»
Polynomial-Time Analysis of Toroidal Periodic Graphs
15 years 5 months ago
Download
www.acs.uni-duesseldorf.de
Franz Höfting, Egon Wanke
claim paper
Read More »
91
click to vote
DM
1998
48
views
more
DM 1998
»
Lattices in graphs with polynomial growth
15 years 5 months ago
Download
www.sztaki.hu
András Lukács, Norbert Seifter
claim paper
Read More »
273
click to vote
DMTCS
2011
261
views
Mathematics
»
more
DMTCS 2011
»
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
14 years 5 months ago
Download
www.math.uni-hamburg.de
Abstract. We present an algorithm that for 2-colorable 3-uniform hypergraphs, finds a 2-coloring in average running time O(n5 log2 n).
Yury Person, Mathias Schacht
claim paper
Read More »
« Prev
« First
page 37 / 175
Last »
Next »