Result 1 to 20 of 305 total
The connectivity and diameter of second order circuit graphs of matroids. (English)
Graphs Comb. 28, No. 5, 737-742 (2012).
1
Topology configuration in hybrid EPS/OCS interconnects. (English)
Kaklamanis, Christos (ed.) et al., Euro-Par 2012 parallel processing. 18th international conference, Euro-Par 2012, Rhodes Island, Greece, August 27‒31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32819-0/pbk). Lecture Notes in Computer Science 7484, 701-715 (2012).
2
Changing the gate order for optimal LNN conversion. (English)
De Vos, Alexis (ed.) et al., Reversible computation. Third international workshop, RC 2011, Gent, Belgium, July 4‒5, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-29516-4/pbk). Lecture Notes in Computer Science 7165, 89-101 (2012).
3
Reduced-by-matching graphs: toward simplifying Hamiltonian circuit problem. (English)
Fundam. Inform. 118, No. 3, 225-244 (2012).
4
Circuit double cover of graphs. (English)
London Mathematical Society Lecture Note Series 399. Cambridge: Cambridge University Press (ISBN 978-0-521-28235-2/pbk; 978-0-511-86315-8/ebook). xxi, 357~p. \sterling~45.00; \$~70.00; \$~56.00/ebook (2012).
5
Kotzig frames and circuit double covers. (English)
Discrete Math. 312, No. 1, 174-180 (2012).
6
Boolean function complexity. Advances and frontiers. (English)
Algorithms and Combinatorics 27. Berlin: Springer (ISBN 978-3-642-24507-7/hbk; 978-3-642-24508-4/ebook). xv, 617~p. EUR~64.95/net; SFR~86.50; \sterling~58.99; \$~84.95 (2012).
7
The complexity of game isomorphism. (English)
Theor. Comput. Sci. 412, No. 48, 6675-6695 (2011).
8
A new algorithm for isomorphism determination of undirected graphs-circuit simulation method. (English)
Circuits Syst. Signal Process. 30, No. 5, 1115-1130 (2011).
9
Local negative circuits and fixed points in non-expansive Boolean networks. (English)
Discrete Appl. Math. 159, No. 11, 1085-1093 (2011).
10
A survey of the gracefulness of digraphs. (English)
Int. J. Pure Appl. Math. 69, No. 3, 245-253 (2011).
11
Coverings and packings of complete directed graphs by odd circuits. (English)
J. Discrete Math. Sci. Cryptography 14, No. 1, 51-75 (2011).
12
Graph polynomials and their applications. II: Interrelations and interpretations. (English)
Dehmer, Matthias (ed.), Structural analysis of complex networks. Basel: Birkhäuser (ISBN 978-0-8176-4788-9/hbk; 978-0-8176-4789-6/ebook). 257-292 (2011).
13
Power distribution networks with on-chip decoupling capacitors. 2nd ed. (English)
New York, NY: Springer (ISBN 978-1-4419-7870-7/hbk; 978-1-4419-7871-4/ebook). xxv, 644~p. EUR~99.95/net; SFR~143.50; \sterling~90.00; \$~129.00 (2011).
14
Reduced communication costs via network flow and scheduling for partitions of dynamically reconfigurable FPGAs. (English)
JISE, J. Inf. Sci. Eng. 26, No. 2, 565-583 (2010).
15
Symmetry-aware placement algorithm using transitive closure graph representation for analog integrated circuits. (English)
Int. J. Circuit Theory Appl. 38, No. 3, 221-241 (2010).
16
Bases axioms and circuits axioms for fuzzifying matroids. (English)
Fuzzy Sets Syst. 161, No. 24, 3155-3165 (2010).
17
Polynomially solvable cases of binary quadratic programs. (English)
Chinchuluun, Altannar (ed.) et al., Optimization and optimal control. Theory and applications. New York, NY: Springer (ISBN 978-0-387-89495-9/hbk; 978-0-387-89496-6/ebook). Springer Optimization and Its Applications 39, 199-225 (2010).
18
Automatic synthesis of lossless matching networks. (English)
Tempesti, Gianluca (ed.) et al., Evolvable systems: From biology to hardware. 9th international conference, ICES 2010, York, UK, September 6‒8, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15322-8/pbk). Lecture Notes in Computer Science 6274, 310-321 (2010).
19
Enumerative properties of rooted circuit maps. (English)
Graphs Comb. 26, No. 4, 513-524 (2010).
20
Result 1 to 20 of 305 total
Start
Contact
Print
General Help
