@prefix owl: <http://www.w3.org/2002/07/owl#> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix dc: <http://purl.org/dc/terms/> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<http://data.loterre.fr/ark:/67375/8LP> a owl:Ontology, skos:ConceptScheme .
<http://data.loterre.fr/ark:/67375/8LP-VV2MRK99-2>
  skos:prefLabel "graph theory"@en, "théorie des graphes"@fr ;
  a skos:Concept ;
  skos:narrower <http://data.loterre.fr/ark:/67375/8LP-RB0R90KJ-7> .

<http://data.loterre.fr/ark:/67375/8LP-RB0R90KJ-7>
  skos:prefLabel "sous-graphe"@fr, "subgraph"@en ;
  skos:inScheme <http://data.loterre.fr/ark:/67375/8LP> ;
  skos:exactMatch <https://www.wikidata.org/wiki/Q7631151> ;
  a skos:Concept ;
  skos:hiddenLabel "Subgraph"@en, "Sous-graphe"@fr ;
  dc:modified "2024-05-21T09:40:32"^^xsd:dateTime ;
  skos:broader <http://data.loterre.fr/ark:/67375/8LP-VV2MRK99-2> ;
  skos:example "This graph-based model captures k-node subgraphs of this graph and represents coherence patterns by the frequency of subgraphs. (Jeon & Strube, 2020)"@en, "For unseen statements we recognize subgraphs of the learned graph compare two weighting methods for extracting different tonality features and classify the statements by a support vector machine. (Scholz & Conrad, 2013)"@en, "Nous posons que la taille d'un sous-graphe est égale au nombre de ses arcs. (Pak & Paroubek, 2011)"@fr, "Since EAE does not require such detailed information we can compress the subgraph to a single node. (Yang, Guo, Hu, Zhang, Qiu & Zhang, 2023)"@en .