您要查找的是不是：
- We call such a spanning subgraph T an economical spanning subgraph. 我们称这样的生成子图T为廉价的生成子图。
- A well known problem in optimization theory asks for a relatively easy way of finding a spanning subgraph with a special property. 最优化理论中的一个有名的问题要求：用比较容易的方法来寻求具有某种特殊性质的生成子图。
- Given a (directed ) graph H, a (directed) graph G is ak-edge fault-tolerantgraph with respect to H, denoted k-EFT (H)graph, if G contains a spanning subgraph isomorphic to H after theremoval of any k edges from G. 给定一个（有向）图H，称（有向）图G为关于H的k-边容错图，记为k－EHT（H）图，若从G中移去任何k条边所得的每个图都含有生成子图同构于H。
- Connected Eulerian Spanning Subgraphs 连通的欧拉生成子图
- Modern medicine has increased man's life span. 现代医学延长了人的寿命。
- The arch has a span of 60 metres. 那个拱的跨度为60米。
- He has settled here for a long span of time. 他已经在这儿定居很长一段时间了。
- They always keep their kitchen spick and span. 他们的厨房总是很整洁。
- The bridge crosses the river in a single span. 河上那座桥是单跨桥。
- spanning subgraph 包含每个顶点的子图
- His life had almost completed its span. 他的生命几已到尽头。
- Spanning or crossing a continent. 横穿大陆的横跨或穿越大陆的
- An obstacle or a span to be jumped. 需跳越的障碍或跨度
- Can you span an octave on the piano? 乍能按到钢琴的八个键吗？
- Finding a Maximum Density Subgraph. 最大密度子图。
- The span of a flag from the staff to the outer edge. 旗子的横幅从旗杆到外面的旗的宽度
- My mother always keeps our house spick and span. 我母亲总是把房子收拾得干干净净。
- Dengxin Li, Deying Li, Jingzhong Mao, On maximum number of edges in a spanning eulerian subgraph, Discrete Mathematics 272(2004) 299-302. 李霄民，李登信，探索极大欧拉生成子图的一种方法，工程数学学报，21（2004）1018-1020
- Second, we find a dense subgraph based on the greedy algorithm. 在第二个步骤，我们利用贪婪演算法找到一个密集的子网路；
- GString can also facilitate similarity subgraph search. GString也能很方便地支持相似子图搜索问题。
