Extracting Small Subgraphs in Road Networks
Abstract
Supplemental Material
- Download
- 23.43 MB
References
Index Terms
- Extracting Small Subgraphs in Road Networks
Recommendations
A tight bound on the collection of edges in MSTs of induced subgraphs
Let G=(V,E) be a complete n-vertex graph with distinct positive edge weights. We prove that for k@?{1,2,...,n-1}, the set consisting of the edges of all minimum spanning trees (MSTs) over induced subgraphs of G with n-k+1 vertices has at most nk-(k+12) ...
Complete bipartite graphs without small rainbow subgraphs
AbstractMotivated by bipartite Gallai–Ramsey type problems, we consider edge-colorings of complete bipartite graphs without rainbow tree and matching. Given two graphs G and H, and a positive integer k, define the bipartite Gallai–Ramsey number bgr k ( G ...
Forbidden Subgraphs and Weak Locally Connected Graphs
A graph is called H-free if it has no induced subgraph isomorphic to H. A graph is called $$N^i$$Ni-locally connected if $$G[\{ x\in V(G): 1\le d_G(w, x)\le i\}]$$G[{x?V(G):1≤dG(w,x)≤i}] is connected and $$N_2$$N2-locally connected if $$G[\{uv: \{uw, vw\...
Comments
Information & Contributors
Information
Published In
- General Chairs:
- Tat-Seng Chua,
- Chong-Wah Ngo,
- Proceedings Chair:
- Roy Ka-Wei Lee,
- Program Chairs:
- Ravi Kumar,
- Hady W. Lauw
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 403Total Downloads
- Downloads (Last 12 months)403
- Downloads (Last 6 weeks)46
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in