1199 search results - page 82 / 240 » Graph Theory |
102
click to vote
WWW
2006
ACM
16 years 4 months ago
2006
ACM
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
144
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
142
click to vote
AGTIVE
2007
Springer
15 years 10 months ago
2007
Springer
In collaborative ontology engineering, contexts are key to manage the complexity of different dependency types between ontological artefacts. Instead of being frustrated by out-of...
150
click to vote
EUROISI
2008
15 years 5 months ago
2008
Abstract. Typical analytical measures in graph theory like degree centrality, betweenness and closeness centralities are very common and have long history of their successful use. ...
132
click to vote
ESOP
2010
Springer
16 years 1 months ago
2010
Springer
Iterated Register Coalescing (IRC) is a widely used heuristic for performing register allocation via graph coloring. Many implementations in existing compilers follow (more or less...