656 search results - page 75 / 132 » Graph Theoretical Characterization and Computation of Answer... |
WG
2005
Springer
14 years 1 months ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
SPIN
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Ontology summarization is very important to quick understanding and selection of ontologies. In this paper, we study extractive summarization of ontology. We propose a notion of R...
COMBINATORICA
2008
13 years 7 months ago
2008
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...