To Draw Is Human: Toward No-Code Subgraph Search
Abstract
References
Index Terms
- To Draw Is Human: Toward No-Code Subgraph Search
Recommendations
Spanning subgraph with Eulerian components
A graph is k-supereulerian if it has a spanning even subgraph with at most k components. We show that if G is a connected graph and G^' is the (collapsible) reduction of G, then G is k-supereulerian if and only if G^' is k-supereulerian. This extends ...
Comments
Information & Contributors
Information
Published In
![cover image Communications of the ACM](/cms/asset/e2fb49ea-c2ee-4338-b691-ac8d77421245/3605915.cover.jpg)
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 3,227Total Downloads
- Downloads (Last 12 months)2,355
- Downloads (Last 6 weeks)44
Other Metrics
Citations
View Options
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderDigital Edition
View this article in digital edition.
Digital EditionMagazine Site
View this article on the magazine site (external)
Magazine SiteGet Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in