Výsledky vyhľadávania - "G.2.2 [Discrete Mathematics]: Graph Theory- Graph algorithms"

Goodness of Fit Measures for Revealed Preference Tests: Complexity Results and Algorithms: Complexity Results and Algorithms

Autori: Laurens Cherchye Frits C. R. Spieksma Bram De Rock a ďalší

Zdroj: SSRN Electronic Journal

Predmety: Sciences informatiques, Business & economic sciences, Goodness-of-fit measures, Economics, G.2.2 [discrete mathematics]: graph theory - graph algorithms, 16. Peace & justice, Computer science, Engineering, computing & technology, Ingénierie, informatique & technologie, Computational complexity, Revealed preference, Testing individual rationality, Microéconomie, Economie, Microeconomics, Sciences économiques & de gestion, Algorithms, F.2.0 [analysis of algorithms and problem complexity]: general, NP-complete

Popis súboru: No full-text files; 1 full-text file(s): application/pdf

Prístupová URL adresa: https://lirias.kuleuven.be/bitstream/123456789/359169/1/KBI_1222.pdf
https://difusion.ulb.ac.be/vufind/Record/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/162939/Details
https://orbi.uliege.be/handle/2268/206625
http://home.agh.edu.pl/~faliszew/COMSOC-2012/proceedings/paper_11.pdf
https://dl.acm.org/doi/10.1145/2560793
https://dblp.uni-trier.de/db/journals/teco/teco2.html#SmeuldersSCR14
https://papers.ssrn.com/sol3/Delivery.cfm/SSRN_ID2165766_code444941.pdf?abstractid=2165766&mirid=3
https://papers.ssrn.com/sol3/papers.cfm?abstract_id=2165766
https://lirias.kuleuven.be/handle/123456789/359169
https://hdl.handle.net/2268/206625
https://doi.org/10.1145/2560793
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/132527

Goodness of fit measures for revealed preference tests: Complexity results and algorithms

Autori: De Rock, Bram Smeulders, Bart Cherchye, Laurens a ďalší

Zdroj: ACM transactions on economics and computation, 2 (1

Predmety: Economie, Algorithms, Computational complexity, Economics, F.2.0 [analysis of algorithms and problem complexity]: general, G.2.2 [discrete mathematics]: graph theory - graph algorithms, Goodness-of-fit measures, NP-complete, Revealed preference, Testing individual rationality

Popis súboru: No full-text files

Relation: uri/info:doi/10.1145/2560793; uri/info:scp/84991604155; uri/info:repec/RePEc:ulb:ulbeco:2013/162939

Dostupnosť: http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/162939

A Visualization Framework and User Studies for Overloaded Orthogonal Drawings.

Autori: Didimo, Walter Kornaropoulos, Evgenios M. Montecchiani, Fabrizio a ďalší

Zdroj: Computer Graphics Forum. Feb2018, Vol. 37 Issue 1, p288-300. 13p. 6 Diagrams, 4 Charts, 1 Graph.

Predmety: *DRAWING, *DATA visualization, *USER interfaces, *INTERACTION design (Human-computer interaction)

AND

Autori: Ronald Fagin David Maier Mihalis Yannakakis a ďalší

Prispievatelia: Ronald Fagin David Maier Mihalis Yannakakis a ďalší

Zdroj: http://www.almaden.ibm.com/cs/people/fagin/jacm83a.pdf.

Predmety: Categories and Sub}ect Descriptors. F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic, G.2.2 [Discrete Mathematics]. Graph Theory--graph algorithms, trees, H.2.1 [Database Manage- ment, Logical Design--normal formy, schema and subschema, H.3.3 [Information Storage and Re- trieval, Information Search and Retneval--queryformulatwn General Terms Algorithms, Design, Languages, Management, Theory Additional Key Words and Phrases, Acyclicity, hypergraph, database scheme, relational database, multivalaed dependency

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.4653; http://www.almaden.ibm.com/cs/people/fagin/jacm83a.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.4653
http://www.almaden.ibm.com/cs/people/fagin/jacm83a.pdf

The Readability of Path-Preserving Clusterings of Graphs.

Autori: Archambault, Daniel Purchase, Helen C. Pinaud, Bruno

Zdroj: Computer Graphics Forum. Jun2010, Vol. 29 Issue 3, p1173-1182. 10p. 3 Color Photographs, 2 Charts, 4 Graphs.

Predmety: *GRAPH theory, *DOCUMENT clustering, *DATA visualization, *INFORMATION filtering systems, *CLUSTER analysis (Statistics), *GRAPHIC methods

Faster Fixed Parameter Tractable Algorithms for Finding Feedback Vertex Sets.

Autori: Raman, Venkatesh Saurabh, Saket Subramanian, C. R.

Zdroj: ACM Transactions on Algorithms; 2006, Vol. 2 Issue 3, p403-415, 13p

Predmety: ACYCLIC model, HOMOLOGICAL algebra, ALGEBRAIC topology, ALGORITHMS, COMPUTATIONAL mathematics, MATHEMATICAL programming

Routing Betweenness Centrality.

Autori: DOLEV, SHLOMI ELOVICI, YUVAL PUZIS, RAMI

Zdroj: Journal of the ACM; Apr2010, Vol. 57 Issue 4, p25:1-25:27, 27p, 4 Diagrams, 1 Chart

Predmety: BETWEENNESS relations (Mathematics), CENTRALITY, COMPUTATIONAL mathematics, ALGORITHM research, ROUTING (Computer network management), COMPUTER network monitoring, VERTEX operator algebras, GRAPH theory, PROBABILISTIC automata

Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows.

Autori: BISWAL, PUNYASHLOKA LEE, JAMES R. RAO, SATISH

Zdroj: Journal of the ACM; Mar2010, Vol. 57 Issue 3, p13:1-13:23, 23p

Predmety: CONFORMAL mapping, MATRICES (Mathematics), ALGORITHMS, MATHEMATICAL transformations, GRAPHIC methods, LAPLACIAN operator

Triangulation and Embedding Using Small Sets of Beacons.

Autori: KLEINBERG, JON SLIVKINS, ALEKSANDRS WEXLER, TOM

Zdroj: Journal of the ACM; Sep2009, Vol. 56 Issue 6, p32-32:37, 37p, 2 Diagrams

Predmety: TRIANGULATION, EMBEDDINGS (Mathematics), DISTRIBUTED algorithms, METRIC spaces, INTERNET, MATRICES (Mathematics)

A Quasi-Polynomial Time Approximation Scheme for Minimum Weight Triangulation.

Autori: REMY, JAN STEGER, ANGELIKA

Zdroj: Journal of the ACM; May2009, Vol. 56 Issue 3, p15:1-15:47, 47p, 19 Diagrams

Predmety: TRIANGULATION, LEAST squares, GEOMETRY problems & exercises, FAMOUS problems in geometry, NP-complete problems, COMPUTATIONAL complexity

Minimum-Weight Triangulation Is NP-Hard.

Autori: Mulzer, Wolfgang Rote, Günter

Zdroj: Journal of the ACM; May2008, Vol. 55 Issue 2, p1-29, 29p, 20 Diagrams, 6 Charts

Predmety: TRIANGULATION, DYNAMIC programming, PLANE geometry, ANALYTIC geometry of planes, EUCLID'S elements, FOUNDATIONS of geometry, NON-Euclidean geometry, ALGORITHMS

On the Impossibility of Dimension Reduction in ℓ1.

Autori: Brinkman, Bo Charikar, Moses

Zdroj: Journal of the ACM; Sep2005, Vol. 52 Issue 5, p766-788, 23p

Predmety: GENERALIZED spaces, FUNCTION spaces, LINEAR programming, MATHEMATICAL programming, ALGORITHMS

Trade-Offs for Fully Dynamic Transitive Closure on DAGs: Breaking through the O(n²) Barrier.

Autori: Demetrescu, Camil Italiano, Giuseppe F.

Zdroj: Journal of the ACM; Mar2005, Vol. 52 Issue 2, p147-156, 10p, 2 Charts

Predmety: ALGORITHMS, GRAPHIC methods, COMPUTATIONAL complexity, MATRICES (Mathematics), QUERY (Information retrieval system)

Approximate Distance Oracles.

Autori: Thorup, Mikkel Zwick, Uri

Zdroj: Journal of the ACM; Jan2005, Vol. 52 Issue 1, p1-24, 24p, 4 Diagrams, 2 Charts

Predmety: ALGORITHMS, DATA structures, DATABASES, ELECTRONIC file management, APPROXIMATION theory

Compact Oracles for Reachability and Approximate Distances in Planar Digraphs.

Autori: Thorup, Mikkel

Zdroj: Journal of the ACM; Nov2004, Vol. 51 Issue 6, p993-1024, 32p, 6 Diagrams

Predmety: DIRECTED graphs, GRAPH theory, TOURNAMENTS (Graph theory), LINEAR time invariant systems, LINEAR systems, VERTEX operator algebras

A New Approach to Dynamic All Pairs Shortest Paths.

Autori: Demetrescu, Camil Italiano, Giuseppe F.

Zdroj: Journal of the ACM; Nov2004, Vol. 51 Issue 6, p968-992, 25p, 9 Diagrams, 3 Charts

Predmety: GRAPH theory, GRAPHIC methods, ALGEBRA, COMBINATORICS, ALGORITHMS, FOUNDATIONS of arithmetic

MIDU: Enabling MIMO Full Duplex.

Autori: Aryafar, Ehsan Khojastepour, Mohammad Sundaresan, Karthikeyan a ďalší

Zdroj: MobiCom: International Conference on Mobile Computing & Networking; 2012, p257-268, 12p

Predmety: WIRELESS communications, MOBILE communication systems, ANTENNAS (Electronics), MIMO systems, FIELD programmable gate arrays

MARVEL: Multiple Antenna based Relative Vehicle Localizer.

Autori: Dong Li Bansal, Tarun Zhixue Lu a ďalší

Zdroj: MobiCom: International Conference on Mobile Computing & Networking; 2012, p245-256, 12p

Predmety: RADIO (Medium), WIRELESS communications, MOBILE communication systems, SMARTPHONE software, MOBILE apps

The mental map and memorability in dynamic graphs.

Autori: Archambault, Daniel Purchase, Helen C.

Zdroj: 2012 IEEE Pacific Visualization Symposium; 1/ 1/2012, p89-96, 8p

On the use of graph search techniques for the analysis of extreme-scale combustion simulation data.

Autori: McLendon, William C. Chen, Jacqueline Bansal, Guarav a ďalší

Zdroj: IEEE Symposium on Large Data Analysis & Visualization (LDAV); 1/ 1/2012, p57-63, 7p