6740 search results - page 377 / 1348 » An s -Hamiltonian Line Graph Problem |
140
click to vote
SWAT
1994
Springer
15 years 8 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
141
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required s...
120
click to vote
CSB
2005
IEEE
15 years 10 months ago
2005
IEEE
Raising seeds for biological experiments is prone to error; a careful experimenter will test in the lab to verify that plants are of the intended strain. Choosing a minimal set of...
115
Voted
FUN
2007
Springer
15 years 8 months ago
2007
Springer
A spreadsheet, especially MS Excel, is probably one of the most popular software applications for personal-computer users and gives us convenient and user-friendly tools for drawin...
140
Voted
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...