1395 search results - page 181 / 279 » (k, )-Distance-Hereditary Graphs |
147
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
160
click to vote
IWPEC
2009
Springer
15 years 11 months ago
2009
Springer
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...
148
click to vote
FCT
1993
Springer
15 years 8 months ago
1993
Springer
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
145
click to vote
ESOP
2009
Springer
15 years 8 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
150
click to vote
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...