4865 search results - page 286 / 973 » The Complexity of Graph Connectivity |
156
click to vote
ENTCS
2006
15 years 6 months ago
2006
We are using ML to build a compiler that does low-level optimization. To support optimizations in classic imperative style, we built a control-flow graph using mutable pointers an...
166
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
159
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of edge ...
155
click to vote
IWPEC
2004
Springer
16 years 17 hour ago
2004
Springer
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
184
click to vote
CVHI
2007
15 years 8 months ago
2007
: Several web sites and e-learning platforms require the access to graphs that carry significant meanings. Understanding and perceiving the graph of a mathematical function is impo...