Effective rule induction from labeled graphs
Abstract
References
Recommendations
Patterns of cation binding to the aromatic amino acid R groups in Trp, Tyr, and Phe
Display Omitted When Na+ is saturated within a system, it will dominate the cation- interactions.Atomic cations bind stronger than the polyatomic cations to clouds.The binding energy goes down as the partial charge increases in the atomic cations.The ...
On Σ and Σ' labelled graphs
A graph G=(V,E) with @d(G")>0, where @d(G) is the minimum degree among the vertices of G, is said to be a sigma labelled graph if there exists a labelling f from V(G") to {1,2,...,|V(G)|} such that for all u@?V(G"), the sum of all f(v) where v@?N(u), ...
Enumerating and generating labeled k-degenerate graphs
ALENEX '10: Proceedings of the Meeting on Algorithm Engineering & ExpermimentsA k-degenerate graph is a graph in which every induced subgraph has a vertex with degree at most k. The class of k-degenerate graphs is interesting from a theoretical point of view and it plays an interesting role in the theory of fixed parameter ...
Comments
Information & Contributors
Information
Published In

Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Article
Conference
Acceptance Rates
Upcoming Conference
- Sponsor:
- sigapp
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 267Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
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