Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Digital libraries (22)
- Deep learning (17)
- Machine learning (12)
- Computer science (11)
- Web archiving (11)
-
- Algorithms (10)
- Neural networks (10)
- Web archives (10)
- Metadata (8)
- Image (7)
- Information systems (7)
- Memento (7)
- Mesh generation (7)
- Protein structure (7)
- Secondary structure (7)
- Cryo-electron microscopy (6)
- Design (6)
- Digital preservation (6)
- Information retrieval (6)
- World Wide Web (6)
- Artificial intelligence (5)
- Computing methodologies (5)
- Eye tracking (5)
- Graphs (5)
- Information dissemination (5)
- Protein (5)
- Screen reader (5)
- Sensor networks (5)
- Summarization (5)
- Telecommunications (5)
- Publication Year
- File Type
Articles 271 - 275 of 275
Full-Text Articles in Physical Sciences and Mathematics
The Strong Perfect Graph Conjecture For Pan-Free Graphs, Stephan Olariu
The Strong Perfect Graph Conjecture For Pan-Free Graphs, Stephan Olariu
Computer Science Faculty Publications
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the largest number ω(F) of pairwise adjacent vertices in F. Berge's famous Strong Perfect Graph Conjecture asserts that a graph G is perfect if and only if neither G nor its complement G contains an odd chordless cycle of length at least five. Its resolution has eluded researchers for more than twenty years. We prove that the conjecture is true for a class of graphs which strictly contains the claw-free graphs.
A New Conjecture About Minimal Imperfect Graphs, H. Meyniel, Stephan Olariu
A New Conjecture About Minimal Imperfect Graphs, H. Meyniel, Stephan Olariu
Computer Science Faculty Publications
H. Meyniel proved that in every minimal imperfect graph, every pair of vertices is joined by a chordless path containing an odd number of edges. We conjectured that in every minimal imperfect graph, every pair of vertices is joined by a path containing an even number of edges. We give an equivalent version of this new conjecture.
Weak Bipolarizable Graphs, Stephan Olariu
Weak Bipolarizable Graphs, Stephan Olariu
Computer Science Faculty Publications
We characterize a new class of perfectly orderable graphs and give a polynomial-time recognition algorithm, together with linear-time optimization algorithms for this class of graphs.
No Antitwins In Minimal Imperfect Graphs, Stephan Olariu
No Antitwins In Minimal Imperfect Graphs, Stephan Olariu
Computer Science Faculty Publications
It is customary to call vertices x and y twins if every vertex distinct from x and y is adjacent either to both of them or to neither of them. By analogy, we shall call vertices x and yantitwins if every vertex distinct from x and y is adjacent to precisely one of them. Lovász proved that no minimal imperfect graph has twins. The purpose of this note is to prove the analogous statement for antitwins.
An Algorithm For The Electromagnetic Scattering Due To An Axially Symmetric Body With An Impedance Boundary Condition, F. Stenger, M. Hagmann, J. Scheing
An Algorithm For The Electromagnetic Scattering Due To An Axially Symmetric Body With An Impedance Boundary Condition, F. Stenger, M. Hagmann, J. Scheing
Computer Science Faculty Publications
Let B be a body in R3, and let S denote the boundary of B. The surface S is described by S = {(x, y, z): (x2 + Y2)½= ƒ(z), -1≤ z ≤ I}, where ƒ analytic function that is real and positive on (-1, 1) and ƒ(±1) = 0. An algorithm is described for computing the scattered field due to a plane wave incident field, under Leontovich boundary conditions. The Galerkin method of solution used here leads to a block diagonal matrix involving 2M …