9532 search results - page 157 / 1907 » Logic, Graphs, and Algorithms |
143
click to vote
EJC
2011
14 years 11 months ago
2011
We present an algorithm which takes a graph as input and decides in cubic time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algor...
166
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
141
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
141
click to vote
FOSSACS
2005
Springer
15 years 10 months ago
2005
Springer
Separation logic is a spatial logic for reasoning locally about heap structures. A decidable fragment of its assertion language was presented in [1], based on a bounded model prope...
128
click to vote
FAW
2009
Springer
15 years 11 months ago
2009
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for parti...