Searching for authors named "Kostas Tsioutsiouliklis" – sorted by Relevance.
9 documents found, showing 1 through 9.
-
Cut Tree Algorithms
- …This is an experimental study of algorithms for the cut tree problem. We study the Gomory-Hu and Gusfield's algorithms as well as heuristics aimed to make the former algorithm faster. We develop an efficient implementation of the Gomory-Hu algorithm. We also develop problem families for testing cut …
- Cited by 1 (0 self) – Add To MetaCart
-
Clustering Methods Based on Minimum-Cut Trees
- …In this paper we introduce a simple clustering method for undirected graphs. The clustering method uses maximum ow techniques on the link-structure of the graph. The quality of the produced clusters is bounded by strong minimum-cut and expansion criteria. We also present a framework for hierarchical…
- Cited by 1 (0 self) – Add To MetaCart
-
Faster Kinetic Heaps and Their Use in Broadcast Scheduling (Extended Abstract)
- …We describe several implementations of the kinetic heap, a heap (priority queue) in which the key of each item, instead of being fixed, is a linear function of time. The kinetic heap is a simple example of a kinetic data structure of the kind considered by Basch, Guibas, and Hershberger. Kinetic hea…
- Cited by 6 (0 self) – Add To MetaCart
-
"Googlearchy": How a Few Heavily-Linked Sites Dominate Politics on the Web
- …Many political scientists have assumed that the World Wide Web would lower the cost of political information and reduce inequalities of attention for those outside the political mainstream. However, computer scientists have consistently reported that the aggregate structure of the Web is antiegalita…
- Cited by 16 (0 self) – Add To MetaCart
-
Panorama: Extending Digital Libraries with Topical Crawlers
- …A large amount of research, technical and professional documents are available today in digital formats. Digital libraries are created to facilitate search and retrieval of information supplied by the documents. These libraries may span an entire area of interest (e.g., computer science) or be limit…
- Cited by 7 (1 self) – Add To MetaCart
-
Cut Tree Algorithms
- …This is an experimental study of algorithms for the cut tree problem. We study the Gomory-Hu and Gusfield's algorithms as well as heuristics aimed to make the former algorithm faster. We develop an e#cient implementation of the Gomory-Hu algorithm. We also develop problem families for testing cut tr…
- Add To MetaCart
-
Using Web Structure for Classifying and Describing Web Pages
- …The structure of the web is increasingly being used to improve organization, search, and analysis of information on the web. For example, Google uses the text in citing documents (documents that link to the target document) for search. We analyze the relative utility of document text, and the text…
- Add To MetaCart
-
Graph clustering and minimum cut trees
- …Abstract. In this paper, we introduce simple graph clustering methods based on minimum cuts within the graph. The clustering methods are general enough to apply to any kind of graph but are well suited for graphs where the link structure implies a notion of reference, similarity, or endorsement, suc…
- Cited by 15 (2 self) – Add To MetaCart
-
Using Web Structure for Classifying and Describing Web Pages
- …The structure of the web is increasingly being used to improve organization, search, and analysis of information on the web. For example, Google uses the text in citing documents (documents that link to the target document) for search. We analyze the relative utility of document text, and the text i…
- Cited by 59 (3 self) – Add To MetaCart
Showing 1 through 9.
