Sciweavers

1002 search results - page 53 / 201
» Towards Graph Programs for Graph Algorithms
Sort
View
HT
2007
ACM
15 years 7 months ago
Toward interactive learning by concept ordering
In this paper we present a visual education tool for efficient and effective learning. The toolkit is based on a simple premise: simple concepts should be learned before advanced ...
Shantanu Godbole, Sachindra Joshi, Sameep Mehta, G...
AAIM
2007
Springer
116views Algorithms» more  AAIM 2007»
15 years 10 months ago
Solving Generalized Maximum Dispersion with Linear Programming
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
Gerold Jäger, Anand Srivastav, Katja Wolf
WAOA
2004
Springer
141views Algorithms» more  WAOA 2004»
15 years 9 months ago
Strong Colorings of Hypergraphs
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
Geir Agnarsson, Magnús M. Halldórsso...

Lecture Notes
443views
17 years 1 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
EACL
1993
ACL Anthology
15 years 5 months ago
Towards efficient parsing with proof-nets
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
Alain Lecomte