4865 search results - page 161 / 973 » The Complexity of Graph Connectivity |
145
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...
107
Voted
ENTCS
2008
15 years 3 months ago
2008
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
150
Voted
CORR
2002
Springer
15 years 3 months ago
2002
Springer
Traditional representations of graphs and their duals suggest the requirement that the dual vertices should be placed inside their corresponding primal faces, and the edges of the ...
133
Voted
EJC
2011
14 years 10 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...
121
click to vote
AUSAI
2004
Springer
15 years 8 months ago
2004
Springer
Hex is a classic board game invented in the middle of the twentieth century by Piet Hein and rediscovered later by John Nash. The best Hex artificial players analyse the board posi...