2125 search results - page 325 / 425 » On Graph Complexity |
100
click to vote
ECCC
2006
15 years 26 days ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
90
Voted
JAIR
2006
15 years 24 days ago
2006
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
118
Voted
CSUR
1999
15 years 15 days ago
1999
The Web can be naturally modeled as a directed graph, consisting of a set of abstract nodes (the pages) joined by directional edges (the hyperlinks). Hyperlinks encode a considerab...
150
Voted
VLDB
2002
ACM
15 years 14 days ago
2002
ACM
Web-based data sources, particularly in Life Sciences, grow in diversity and volume. Most of the data collections are equipped with common document search, hyperlink and retrieval...
188
Voted
VEE
2012
ACM
13 years 8 months ago
2012
ACM
Applications written in dynamically typed scripting languages are increasingly popular for Web software development. Even on the server side, programmers are using dynamically typ...