1883 search results - page 60 / 377 » Ordered theta graphs |
108
click to vote
FCCM
2006
IEEE
15 years 8 months ago
2006
IEEE
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
118
Voted
DAM
2011
14 years 8 months ago
2011
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
131
click to vote
PVLDB
2010
15 years 8 days ago
2010
Graphs are of growing importance in modeling complex structures such as chemical compounds, proteins, images, and program dependence. Given a query graph Q, the subgraph isomorphi...
128
Voted
GC
2008
Springer
15 years 1 months ago
2008
Springer
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...
77
Voted
ENTCS
2007
15 years 1 months ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...