796 search results - page 85 / 160 » The Anonymous Subgraph Problem |
144
click to vote
DIS
2007
Springer
15 years 4 months ago
2007
Springer
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
152
Voted
SIROCCO
1997
15 years 2 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
93
Voted
SIAMDM
2010
14 years 11 months ago
2010
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...
108
click to vote
JCB
2007
15 years 20 days ago
2007
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
94
Voted
ARSCOM
2005
15 years 21 days ago
2005
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...