3267 search results - page 481 / 654 » Generalized quasirandom graphs |
163
click to vote
FOCS
2006
IEEE
16 years 17 days ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
167
click to vote
SCAM
2006
IEEE
16 years 16 days ago
2006
IEEE
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...
170
click to vote
HT
2005
ACM
16 years 2 days ago
2005
ACM
Hypertext can be seen as a logic representation, where semantics are encoded in both the textual nodes and the graph of links. Systems that have a very formal representation of th...
150
click to vote
MSR
2005
ACM
16 years 2 days ago
2005
ACM
Source Control Repositories are used in most software projects to store revisions to source code files. These repositories operate at the file level and support multiple users. ...
201
click to vote
APPROX
2005
Springer
16 years 2 days ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...