Results 241 to 250 of about 25,369 (266)
Some of the next articles are maybe not open access.
1990
Given a graph \(G\), a covering of \(G\) is a set of subgraphs \(\{G_ 1,G_ 2,\dots,G_ k\}\) such that every edge of \(G\) is in some \(G_ i\). A set of edges \(\{e_ 1,e_ 2,\dots,e_ k\}\) with \(e_ i\in E(G_ i)\) is called a set of distinct representing edges. \textit{L.
openaire +2 more sources
Given a graph \(G\), a covering of \(G\) is a set of subgraphs \(\{G_ 1,G_ 2,\dots,G_ k\}\) such that every edge of \(G\) is in some \(G_ i\). A set of edges \(\{e_ 1,e_ 2,\dots,e_ k\}\) with \(e_ i\in E(G_ i)\) is called a set of distinct representing edges. \textit{L.
openaire +2 more sources
Infinite Feature Selection: A Graph-based Feature Filtering Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021Marco Cristani +2 more
exaly
All countable monoids embed into the monoid of the infinite random graph
Discrete Mathematics, 2010Igor Dolinka, Anthony Bonato
exaly
Graph Reachability and Pebble Automata over Infinite Alphabets
ACM Transactions on Computational Logic, 2013Tony Tan
exaly
Semiprojectivity and properly infinite projections in graph C⁎-algebras
Advances in Mathematics, 2017Søren Eilers, Takeshi Katsura
exaly
A problem in infinite graph-theory
Abhandlungen Aus Dem Mathematischen Seminar Der Universitat Hamburg, 1975Halin R, R Halin
exaly
Infinite Impulse Response Graph Filters in Wireless Sensor Networks
IEEE Signal Processing Letters, 2015Xuesong Shi, Hui Feng, Tao Yang
exaly