[go: up one dir, main page]

Kamiński et al., 2018 - Google Patents

Multigraphs without large bonds are wqo by contraction

Kamiński et al., 2018

View PDF
Document ID
7446843598596797176
Author
Kamiński M
Raymond J
Trunck T
Publication year
Publication venue
Journal of Graph Theory

External Links

Snippet

Multigraphs without large bonds are wqo by contraction - Kamiński - 2018 - Journal of Graph Theory - Wiley Online Library Skip to Article Content Skip to Article Information Wiley Online Library Wiley Online Library Search within Search term Advanced Search Citation Search …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F17/30705—Clustering or classification
    • G06F17/3071—Clustering or classification including class or cluster creation or modification
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce, e.g. shopping or e-commerce

Similar Documents

Publication Publication Date Title
Kosasih et al. A machine learning approach for predicting hidden links in supply chain with graph neural networks
Berlingerio et al. Abacus: frequent pattern mining-based community discovery in multidimensional networks
Anand et al. Experimental comparisons of clustering approaches for data representation
Eyal-Salman et al. Feature-to-code traceability in a collection of software variants: Combining formal concept analysis and information retrieval
US20120303611A1 (en) Information processing device, information processing method, and computer-readable recording medium
Ruano-Ordas et al. Concept drift in e-mail datasets: An empirical study with practical implications
Gong et al. Keywords‐driven web APIs group recommendation for automatic app service creation process
Wu et al. Mining compact high utility itemsets without candidate generation
CN101796795A (en) Distributed system
Mumin et al. An efficient algorithm for link prediction based on local information: Considering the effect of node degree
Rad et al. Automatic image annotation by a loosely joint non‐negative matrix factorisation
Afzal et al. Assemble: Attribute, structure and semantics based service mapping approach for collaborative business process development
Cutler et al. Extremal graphs for homomorphisms II
Kamiński et al. Multigraphs without large bonds are wqo by contraction
Saeed et al. Efficient Utility Tree‐Based Algorithm to Mine High Utility Patterns Having Strong Correlation
Sassi et al. An overview of big data and machine learning paradigms
Linial et al. On the rigidity of sparse random graphs
Faci et al. cgspan: Pattern mining in conceptual graphs
Bhat B et al. A single‐phase algorithm for mining high utility itemsets using compressed tree structures
Zhuang et al. PBA: Partition and blocking based alignment for large knowledge bases
Liu et al. A simple greedy algorithm for the profit-aware social team formation problem
Jindal et al. Ranking in multi label classification of text documents using quantifiers
Peeva et al. Grouping local process models
Osei-Bryson et al. Exploration of a hybrid feature selection algorithm
Hu et al. Semantic‐Based Requirements Content Management for Cloud Software