1402 search results - page 120 / 281 » Searching Cycle-Disjoint Graphs |
141
click to vote
PODC
2011
ACM
14 years 26 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
AE
2007
Springer
15 years 4 months ago
2007
Springer
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
IEEEARES
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Attack Graphs are an important support for assessment and subsequent improvement of network security. They reveal possible paths an attacker can take to break through se...
CIKM
2008
Springer
15 years 23 hour ago
2008
Springer
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
SIGIR
2008
ACM
14 years 10 months ago
2008
ACM
Comments left by readers on Web documents contain valuable information that can be utilized in different information retrieval tasks including document search, visualization, and ...